Invertible cellular automata: A review

Physica D: Nonlinear Phenomena

Volumn 45, Issue 1-3, 1990, Pages 229-253

  Toffoli, Tommaso ^a   Margolus, Norman H ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001566941     PISSN: 01672789     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-2789(90)90185-R     Document Type: Article

References (97)

1. Computability in homogeneous structures
2. Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
3. Some clarifications of the concept of a Garden-of-Eden configuration
4. Information processing and transmission in cellular automata
5. Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: applications to Turing machines
6. Logical Reversibility of Computation
7. Role of irreversibility in stabilizing complex and nonenergodic behavior in locally interacting discrete systems
8. On the nature and origin of complexity in discrete, homogeneous, locally-interacting systems
9. Bond-energy variables for Ising spin-glass dynamics
10. Cellular Automata '86
11. On the partial difference equations of mathematical physics
12. Deterministic Ising dynamics
13. On invertible cellular automata
14. Invariants in lattice gas models
15. The theory of the universal wave function
16. Quantum Mechanical Computers
17. Conservative logic
18. Conservative logic
19. Conservative logic
20. Conservative logic
21. Lattice-gas automata for the Navier-Stokes equation
22. Lattice gas hydrodynamics in two and three dimensions
23. Mathematical Games
24. Local structure theory for cellular automata
25. A hierarchical classification of cellular automata
26. Molecular dynamics of a classical lattice gas: transport properties and time correlation functions
27. Discrete fluids
28. Discrete fluids
29. The effect of Galilean non-invariance in lattice gas automaton one-dimensional flow
30. One-dimensional cellular automata: injectivity from unambiguity
31. All onto functions of span less than or equal to five
32. Endomorphisms and automorphisms of the shift dynamical system
33. Optimization of collision rules in the FCHC lattice gases and addition of rest particles
34. On the relation between lattice gases and cellular automata
35. Reversible parallel computation: an evolving space model
36. Information theory and statistical mechanics
37. Information theory and statistical mechanics
38. Symplectic cellular automata
39. Reversibility and surjectivity of cellular automata
40. Reversibility of 2D cellular automata is undecidable
41. Physics-like models of computation
42. Quantum Computation
43. Physics and Computation
44. Cellular Automata Machines
45. Cellular automata supercomputers for fluid dynamics modeling
46. Conditions for injectivity of global maps for tessellation automata
47. Injectivity and surjectivity of parallel maps for cellular automata
48. Strong surjectivity is equivalent to C-injectivity
49. Computation universality of one-dimensional reversible (injective) cellular automata
50. Machine models of self-reproduction
51. The firing squad synchronization problem
52. Invertible isotopies
53. Local maps inducing surjective global maps of one-dimensional tessellation automata
54. Two-dimensional cellular automata
55. State-transition structures in physics and in computation
56. Invariant in cellular automata
57. Tessellation with local transformations
58. Certain relations between properties of maps of tessellation automata
59. The automorphisms of the shift dynamical systems are relatively sparse
60. Cellular automata theory
61. Reversible cellular automata and statistical mechanics
62. Representations of geometrical and topological quantities in cellular automata
63. Relaxation properties of elementary reversible cellular automata
64. Computation and construction universality of reversible cellular automata
65. Cellular automata mechanics
66. Bicontinuous extension of reversible combinatorial functions
67. CAM: A high-performance cellular-automaton machine
68. Cellular automata as an alternative to (rather than an approximation of) differential equations in modeling physics
69. Information transport obeying the continuity equation
70. Four topics in lattice gases: ergodicity; relativity; information flow; and rule compression for parallel lattice-gas machines
71. How cheap can mechanics' first principles be?
72. Frontiers in computing
73. Programmable matter
74. On computable numbers, with an application to the Entscheidungsproblem
75. Random processes and transformations
76. Simulating physics with cellular automata
77. Statistical mechanics of cellular automata
78. Universality and complexity in cellular automata
79. Computation theory of cellular automata
80. Cellular automaton fluids 1: basic theory
81. Inverse and injectivity of parallel relations induced by cellular automata
82. Calculating Space