论文信息 - The Computational Complexity of Cellular Automata

The Computational Complexity of Cellular Automata

We study the computational complexity of the evolution of configurations on finite and infinite cellular automata. We will show that a classification of cellular automata suggested by Culik and Yu and based on Wolfram's earlier heuristic classification leads to classes that are II 2 0 -complete and is Σ 3 0 -complete.

Klaus Sutner

[1] A. Odlyzko,et al. Algebraic properties of cellular automata , 1984 .

[2] Karel Culik,et al. Undecidability of CA Classification Schemes , 1988, Complex Syst..

[3] Karel Culik,et al. A Simple Universal Cellular Automaton and its One-Way and Totalistic Version , 1987, Complex Syst..

[4] Takeo Yaku,et al. The Constructibility of a Configuration in a Cellular automaton , 1973, J. Comput. Syst. Sci..

[5] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[6] Arthur W. Burks,et al. Essays on cellular automata , 1970 .

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

[8] Karel Culik,et al. On Invertible Cellular Automata , 1987, Complex Syst..

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

[10] Frederic Green,et al. NP-Complete Problems in Cellular Automata , 1987, Complex Syst..

[11] S. Wolfram. Computation theory of cellular automata , 1984 .

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

[13] Stephen Wolfram,et al. Universality and complexity in cellular automata , 1983 .

[14] Stephen Wolfram,et al. Computer Software in Science and Mathematics. , 1984 .