Reversibility of 2D cellular automata is undecidable

https://doi.org/10.1016/0167-2789(90)90195-UGet rights and content

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.

References (11)

There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 1990 Published by Elsevier B.V.