Theory of Reversible Computing

✍ Scribed by Kenichi Morita (auth.)

• Publisher: Springer Japan
• Year: 2017
• Tongue: English
• Leaves: 463
• Series: Monographs in Theoretical Computer Science. An EATCS Series
• Edition: 1
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Front Matter ....Pages i-xvii
Introduction (Kenichi Morita)....Pages 1-13
Reversible Logic Elements with Memory (Kenichi Morita)....Pages 15-30
Classification of Reversible Logic Elements with Memory and Their Universality (Kenichi Morita)....Pages 31-75
Reversible Logic Gates (Kenichi Morita)....Pages 77-101
Reversible Turing Machines (Kenichi Morita)....Pages 103-156
Making Reversible Turing Machines from Reversible Primitives (Kenichi Morita)....Pages 157-172
Universal Reversible Turing Machines (Kenichi Morita)....Pages 173-201
Space-Bounded Reversible Turing Machines (Kenichi Morita)....Pages 203-228
Other Models of Reversible Machines (Kenichi Morita)....Pages 229-259
Reversible Cellular Automata (Kenichi Morita)....Pages 261-298
One-Dimensional Universal Reversible Cellular Automata (Kenichi Morita)....Pages 299-329
Two-Dimensional Universal Reversible Cellular Automata (Kenichi Morita)....Pages 331-365
Reversible Elementary Triangular Partitioned Cellular Automata (Kenichi Morita)....Pages 367-419
Self-reproduction in Reversible Cellular Automata (Kenichi Morita)....Pages 421-447
Back Matter ....Pages 449-457

✦ Subjects

Theory of Computation