Reversibility of 2D cellular automata is undecidable
Abstract
The problem whether a given two- or higher-dimensional cellular automaton is reversible is shown to be algorithmically undecidable. A cellular automaton is called reversible if it has an inverse automaton, that is a cellular automaton that makes the system retrace its steps backwards in time. The same problem is known to be decidable for one-dimensional automata.
- Publication:
-
Physica D Nonlinear Phenomena
- Pub Date:
- September 1990
- DOI:
- 10.1016/0167-2789(90)90195-U
- Bibcode:
- 1990PhyD...45..379K