A Random NP-Complete Problem for Inversion of 2D Cellular Automata

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.

[1]  Serafino Amoroso,et al.  Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tessellation Structures , 1972, J. Comput. Syst. Sci..

[2]  Bruno Durand.  Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof , 1993, FCT.

[3]  Jarkko Kari,et al.  Reversibility and Surjectivity Problems of Cellular Automata , 1994, J. Comput. Syst. Sci..

[4]  Bruno Durand.  Global Properties of 2D Cellular Automata: Some Complexity Results , 1993, MFCS.

[5]  Yuri Gurevich.  Complete and incomplete randomized NP problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[6]  Leonid A. Levin,et al.  Average Case Complete Problems , 1986, SIAM J. Comput..

[7]  N. Margolus,et al.  Invertible cellular automata: a review , 1991 .

[8]  D. Richardson,et al.  Tessellations with Local Transformations , 1972, J. Comput. Syst. Sci..

[9]  R. Robinson.  Undecidability and nonperiodicity for tilings of the plane , 1971 .

[10]  Klaus Sutner,et al.  De Bruijn Graphs and Linear Cellular Automata , 1991, Complex Syst..

[11]  O. Goldreich,et al.  On the theory of average case complexity , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[12]  Bruno Durand.  Inversion of 2D Cellular Automata: Some Complexity Results , 1994, Theor. Comput. Sci..

[13]  Andreas Blass,et al.  Randomizing Reductions of Search Problems , 1993, SIAM J. Comput..

[14]  J. Myhill.  The converse of Moore’s Garden-of-Eden theorem , 1963 .

[15]  E. F. Moore.  Machine Models of Self-Reproduction , 1962 .

[16]  Oded Goldreich,et al.  On the theory of average case complexity , 1989, STOC '89.

[17]  Yuri Gurevich,et al.  Average Case Completeness , 1991, J. Comput. Syst. Sci..

[18]  Andreas Blass,et al.  Matrix Transformation Is Complete for the Average Case , 1995, SIAM J. Comput..

[19]  Robert L. Berger.  The undecidability of the domino problem , 1966 .

[20]  Bruno Durand.  The Surjectivity Problem for 2D Cellular Automata , 1994, J. Comput. Syst. Sci..