Authors:
- Authored by the leading scientist on the subject
- Valuable reference work for anyone working in reversible computation and automata theory
- First book written in English on reversible computing from the viewpoint of the theory of computing
Part of the book series: Monographs in Theoretical Computer Science. An EATCS Series (EATCS)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (14 chapters)
-
Front Matter
-
Back Matter
About this book
This book describes reversible computing from the standpoint of the theory of automata and computing. It investigates how reversibility can be effectively utilized in computing. A reversible computing system is a “backward deterministic” system such that every state of the system has at most one predecessor. Although its definition is very simple, it is closely related to physical reversibility, one of the fundamental microscopic laws of Nature. Authored by the leading scientist on the subject, this book serves as a valuable reference work for anyone working in reversible computation or in automata theory in general.
This work deals with various reversible computing models at several different levels, which range from the microscopic to the macroscopic, and aims to clarify how computation can be carried out efficiently and elegantly in these reversible computing models. Because the construction methods are often unique and different from those in the traditional methods, these computing models as well as the design methods provide new insights for future computing systems.
Organized bottom-up, the book starts with the lowest scale of reversible logic elements and circuits made from them. This is followed by reversible Turing machines, the most basic computationally universal machines, and some other types of reversible automata such as reversible multi-head automata and reversible counter machines. The text concludes with reversible cellular automata for massively parallel spatiotemporal computation. In order to help the reader have a clear understanding of each model, the presentations of all different models follow a similar pattern: the model is given in full detail, a short informal discussion is held on the role of different elements of the model, and an example with illustrations follows each model.
Reviews
Authors and Affiliations
-
Professor Emeritus, Hiroshima University, Hiroshima, Japan
Kenichi Morita
About the author
Kenichi Morita is a professor emeritus of Hiroshima University. He received a Ph.D. in engineering from Osaka University in 1978, and he was a professor of the Graduate School of Engineering, Hiroshima University. He is engaged in the research of automata theory, cellular automata, reversible computing, and formal language theory.
Bibliographic Information
Book Title: Theory of Reversible Computing
Authors: Kenichi Morita
Series Title: Monographs in Theoretical Computer Science. An EATCS Series
DOI: https://doi.org/10.1007/978-4-431-56606-9
Publisher: Springer Tokyo
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Japan KK 2017
Hardcover ISBN: 978-4-431-56604-5Published: 17 November 2017
Softcover ISBN: 978-4-431-56832-2Published: 23 May 2018
eBook ISBN: 978-4-431-56606-9Published: 06 November 2017
Series ISSN: 1431-2654
Series E-ISSN: 2193-2069
Edition Number: 1
Number of Pages: XVII, 457