Logical Universality and Self-Reproduction in Reversible Cellular Automata

A reversible cellular automaton (RCA) is a “backward deterministic” CA in which every configuration of the cellular space has at most one predecessor. Such reversible systems have a close connection to physical reversibility, and have been known to play an important role in the problem of inevitable power dissipation in computing systems. In this paper, we investigate problems of logical universality and self-reproducing ability in two-dimensional reversible cellular spaces. These problems will become much more important when one tries to construct nano-scaled functional objects based on microscopic physical law. Here, we first discuss how logical universality can be obtained under the reversibility constraint, and show our previous models of 16-state universal reversible CA. Next we explain how self-reproduction is possible in a reversible CA.

[1]  Tommaso Toffoli,et al.  Computation and Construction Universality of Reversible Cellular Automata , 1977, J. Comput. Syst. Sci..

[2]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[3]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[4]  R. Landauer,et al.  The Fundamental Physical Limits of Computation. , 1985 .

[5]  N. Margolus.  Physics-like models of computation☆ , 1984 .

[6]  R. Laing.  Automaton models of reproduction by self-inspection. , 1977, Journal of theoretical biology.

[7]  Dale P. Cruikshank,et al.  The Moons of Uranus, Neptune and Pluto. , 1985 .

[8]  John Watrous,et al.  On one-dimensional quantum cellular automata , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[9]  Kenichi Morita,et al.  Reversible Simulation of One-Dimensional Irreversible Cellular Automata , 1995, Theor. Comput. Sci..

[10]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[11]  C. Langton.  Self-reproduction in cellular automata , 1984 .

[12]  Jesús Ibáñez,et al.  Self-Inspection Based Reproduction in Cellular Automata , 1995, ECAL.

[13]  Charles H. Bennett,et al.  The thermodynamics of computation—a review , 1982 .

[14]  Kenichi Morita,et al.  Computation-Universality of One-Dimensional One-Way Reversible Cellular Automata , 1992, Inf. Process. Lett..

[15]  N. Margolus,et al.  Invertible cellular automata: a review , 1991 .

[16]  T. Toffoli,et al.  Conservative logic , 2002, Collision-Based Computing.

[17]  K. Morita,et al.  Computation universality of one-dimensional reversible (injective) cellular automata , 1989 .

[18]  Katsunobu Imai,et al.  Self-Reproduction in a Reversible Cellular Space , 1996, Theor. Comput. Sci..

[19]  R. Feynman.  Simulating physics with computers , 1999 .

[20]  E. F. Codd,et al.  Cellular automata , 1968 .

[21]  Kenichi Morita,et al.  Computation-Universal Models of Two-Dimensional 16-State Reversible Cellular Automata , 1992 .