Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
Ininvertible cellular automata: a review
Physica D
Computation-universality of one-dimensional one-way reversible cellular automata
Information Processing Letters
Reversible simulation of one-dimensional irreversible cellular automata
Theoretical Computer Science
Feynman and computation
Reversible space-time simulation of cellular automata
Theoretical Computer Science
Collision-based computing
Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata
LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
A pedestrian's introduction to spacetime crystallography
IBM Journal of Research and Development
When–and how–can a cellular automaton be rewritten as a lattice gas?
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Can anything from noether's theorem be salvaged for discrete dynamical systems?
UC'11 Proceedings of the 10th international conference on Unconventional computation
Natural Computing: an international journal
Hi-index | 0.00 |
In second-order cellular automata, the signals made available to the local transition function include, besides the current state of a site's neighbors, also the previous state of the site itself. Some similarities had been noted, especially in physics simulations, between certain second-order cellular automata and certain lattice gases.Here we show how to construct, for any second-order cellular automaton, a lattice gas having isomorphic functional behavior. (Paradoxically, this isomorphism of function is achieved by compromising on the isomorphism of structure: namely, the group of translation symmetries of the resulting lattice gas is coarser than that of the original cellular automaton.) The advantage of our construction is that, while invertibility in cellular automata is not directly deducible from the local map (indeed, it is in general undecidable), in the second-order case the invertibility of the cellular automaton goes hand-in-hand with that of the corresponding lattice gas--and for lattices gases invertibility is trivially decidable on the basis of the local structure.From a physical viewpoint, our construction illustrates a trade-off between two ways of achieving a "force" of a given range. In a cellular automaton, multiple copies of a signal are made and distributed in parallel to several sites, explicitly providing the desired fanout width. In a lattice gas, with our construction, one can let a single signal serially service a number of sites along an appropriate spacetime route. The latter method is better suited to a nondissipative implementation of the dynamics.