Reversible computing and cellular automata-A survey

Theoretical Computer Science

Volumn 395, Issue 1, 2008, Pages 101-131

  Morita, Kenichi ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Computation universality; Reversible cellular automata; Reversible logic element; Reversible Turing machine

Indexed keywords

COMPUTATIONAL METHODS; FORMAL LOGIC; LOGIC CIRCUITS; MATHEMATICAL MODELS; PERSONAL COMPUTERS; TURING MACHINES;

PHYSICAL REVERSIBILITY; REVERSIBLE CELLULAR AUTOMATA; REVERSIBLE COMPUTING; REVERSIBLE LOGIC ELEMENTS; REVERSIBLE TURING MACHINES;

CELLULAR AUTOMATA;

EID: 41149107262     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.01.041     Document Type: Article

References (51)

1. Amoroso S., and Cooper G. The Garden of Eden theorem for finite configurations. Proc. Amer. Math. Soc. 26 (1970) 158-164
2. Amoroso S., and Patt Y.N. Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. J. Comput. Syst. Sci. 6 (1972) 448-464
3. Baiocchi C. Three small universal Turing machines. 3rd Int. Conference on Machines, Computations, and Universality. LNCS vol. 2055 (2001), Springer-Verlag 1-10
4. Bennett C.H. Logical reversibility of computation. IBM J. Res. Dev. 17 (1973) 525-532
5. Bennett C.H. The thermodynamics of computation. Int. J. Theoret. Phys. 21 (1982) 905-940
6. Bennett C.H. Notes on the history of reversible computation. IBM J. Res. Dev. 32 (1988) 16-23
7. Bennett C.H. Time/space trade-offs for reversible computation. SIAM J. Comput. 18 (1989) 766-776
8. Boykett T. Efficient exhaustive listings of reversible one dimensional cellular automata. Theoret. Comput. Sci. 325 (2004) 215-247
9. Cook M. Universality in elementary cellular automata. Complex Systems 15 (2004) 1-40
10. Feynman R.P. In: Hey A.J.G., and Allen R.W. (Eds). Feynman Lectures on Computation (1996), Perseus Books, Reading, MA
11. Fredkin E., and Toffoli T. Conservative logic. Int. J. Theoret. Phys. 21 (1982) 219-253
12. Hedlund G.A. Endomorphisms and automorphisms of the shift dynamical system. Math. Systems Theory 3 (1969) 320-375
13. Imai K., and Morita K. Firing squad synchronization problem in reversible cellular automata. Theoret. Comput. Sci. 165 (1996) 475-482
14. Imai K., and Morita K. A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theoret. Comput. Sci. 231 (2000) 181-191
15. Imai K., Hori T., and Morita K. Self-reproduction in three-dimensional reversible cellular space. Artificial Life 8 (2002) 155-174
16. Kari J. Reversibility and surjectivity problems of cellular automata. J. Comput. Syst. Sci. 48 (1994) 149-182
17. Kari J. Theory of cellular automata: A survey. Theoret. Comput. Sci. 334 (2005) 3-33
18. Kudlek M., and Rogozhin Y. A universal Turing machine with 3 states and 9 symbols. Developments in Language Theory (DLT 2001). LNCS vol. 2295 (2002), Springer-Verlag 311-318
19. Landauer R. Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5 (1961) 183-191
20. n u, où θ est un isomorphisme de codes. C. R. Hebd. Seances Acad. Sci. 257 (1963) 2597-2600
21. J. Lee, personal communication, 2004
22. M. Margenstern, Surprising areas in the quest for small universal devices, MFCSIT 2006, Cork, Electronic Notes in Theoret. Comput. Sci. (in press)
23. Margolus N. Physics-like model of computation. Physica 10D (1984) 81-95
24. Maruoka A., and Kimura M. Condition for injectivity of global maps for tessellation automata. Inf. Control 32 (1976) 158-162
25. Maruoka A., and Kimura M. Injectivity and surjectivity of parallel maps for cellular automata. J. Comput. Syst. Sci. 18 (1979) 47-64
26. Minsky M.L. Computation: Finite and Infinite Machines (1967), Prentice-Hall, Englewood Cliffs, NJ
27. Moore E.F. Machine models of self-reproduction. In: Burks A.W. (Ed). Essays on Cellular Automata (1970), University of Illinois Press, Urbana 187-203
28. Mora J.C.S.T., Vergara S.V.C., Martinez G.J., and McIntosh H.V. Procedures for calculating reversible one-dimensional cellular automata. Physica D 202 (2005) 134-141
29. Morita K., Shirasaki A., and Gono Y. A 1-tape 2-symbol reversible Turing machine. Trans. IEICE Japan E-72 (1989) 223-228
30. Morita K., and Harao M. Computation universality of one-dimensional reversible (injective) cellular automata. Trans. IEICE Japan E-72 (1989) 758-762
31. Morita K. A simple construction method of a reversible finite automaton out of Fredkin gates, and its related problem. Trans. IEICE Japan E-73 (1990) 978-984
32. Morita K., and Ueno S. Computation-universal models of two-dimensional 16-state reversible cellular automata. IEICE Trans. Inf. Syst. E75-D (1992) 141-147
33. Morita K. Universality of a reversible two-counter machine. Theoret. Comput. Sci. 168 (1996) 303-320
34. Morita K., and Imai K. Self-reproduction in a reversible cellular space. Theoret. Comput. Sci. 168 (1996) 337-366
35. Morita K. A simple reversible logic element and cellular automata for reversible computing. Proc. 3rd Int. Conf. on Machines, Computations, and Universality. LNCS vol. 2055 (2001), Springer-Verlag 102-113
36. Morita K., Tojima Y., Imai K., and Ogiro T. Universal computing in reversible and number-conserving two-dimensional cellular spaces. In: Adamatzky A. (Ed). Collision-based Computing (2002), Springer-Verlag 161-199
37. Morita K. A new universal logic element for reversible computing. In: Martin-Vide C., and Mitrana V. (Eds). Grammars and Automata for String Processing (2003), Taylor & Francis, London 285-294
38. Morita K., Ogiro T., Tanaka K., and Kato H. Classification and universality of reversible logic elements with one-bit memory. Proc. 4th Int. Conf. on Machines, Computations, and Universality. LNCS vol. 3354 (2005), Springer-Verlag 245-256
39. Morita K., and Yamaguchi Y. A universal reversible Turing machine. Proc. 5th Int. Conf. on Machines, Computations, and Universality. LNCS vol. 4664 (2007), Springer-Verlag 90-98
40. Morita K. Simple universal one-dimensional reversible cellular automata. J. Cellular Automata 2 (2007) 159-165
41. Myhill J. The converse of Moore's Garden-of-Eden theorem. In: Burks A.W. (Ed). Essays on Cellular Automata (1970), University of Illinois Press, Urbana 204-205
42. Neary T., and Woods D. Four small universal Turing machines. Proc. 5th Int. Conf. on Machines, Computations, and Universality. LNCS vol. 4664 (2007), Springer-Verlag 242-254
43. Ogiro T., Kanno A., Tanaka K., Kato H., and Morita K. Nondegenerate 2-state 3-symbol reversible logic elements are all universal. Int. J. Unconventional Comput. 1 (2005) 47-67
44. Petri C.A. Grundsätzliches zur Beschreibung diskreter Prozesse. Proc. 3rd Colloquium über Automatentheorie (1967), Birkhäuser Verlag 121-140
45. Richardson D. Tessellations with local transformations. J. Comput. Syst. Sci. 6 (1972) 373-388
46. Rogozhin Y. Small universal Turing machines. Theoret. Comput. Sci. 168 (1996) 215-240
47. Toffoli T. Computation and construction universality of reversible cellular automata. J. Comput. Syst. Sci. 15 (1977) 213-231
48. Toffoli T. Reversible computing. In: de Bakker J.W., and van Leeuwen J. (Eds). Automata, Languages and Programming. LNCS vol. 85 (1980), Springer-Verlag 632-644
49. Toffoli T. Bicontinuous extensions of invertible combinatorial functions. Math. Syst. Theory 14 (1981) 12-23
50. Toffoli T., and Margolus N. Invertible cellular automata: A review. Physica D 45 (1990) 229-253
51. Woods D., and Neary T. Small semi-weakly universal Turing machines. Proc. 5th Int. Conf. on Machines, Computations, and Universality. LNCS vol. 4664 (2007), Springer-Verlag 303-315