Abstract
In this paper, we prove the co-RNP-completeness (RNP=Random NP) of the following decision problem: “Given a 2-dimensional cellular automaton A, is A reversible when restricted to finite configurations extending a given row?” In order to prove this result, we introduce a polynomial reduction from problems concerning finite tilings into problems concerning cellular automata. Then we add to tile sets and cellular automata two probability functions and we prove that these problems are not only co-NP-complete, but co-RNP-complete too.
Author supplied keywords
Cite
CITATION STYLE
Durand, B. (1995). A random NP-complete problem for inversion of 2D cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 900, pp. 95–106). Springer Verlag. https://doi.org/10.1007/3-540-59042-0_65
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
