论文信息 - Cellular Automata and Intermediate Reachability Problems - 字舞流文

Cellular Automata and Intermediate Reachability Problems

We exhibit one-dimensional cellular automata whose reachability and confluence problems have arbitrary r.e. degree of unsolvability.

Klaus Sutner | Klaus Sutner

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

[2] Miles Davis,et al. A Note on Universal Turing Machines , 1970 .

[3] Klaus Sutner,et al. Computation theory of cellular automata , 1998 .

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

[5] Klaus Sutner. Classifying circular cellular automata , 1991 .

[6] Saharon Shelah,et al. On the Classifiability of Cellular Automata , 1998, Theor. Comput. Sci..

[7] Klaus Sutner,et al. On the Computational Complexity of Finite Cellular Automata , 1995, J. Comput. Syst. Sci..

[8] Klaus Sutner,et al. Cellular automata and intermediate degrees , 2003, Theor. Comput. Sci..

[9] N. S. Barnett,et al. Private communication , 1969 .

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

[11] J. C. Shepherdson,et al. Machine Configuration and Word Problems of Given Degree of Unsolvability , 1965 .

[12] R. Soare. Recursively enumerable sets and degrees , 1987 .

[13] Manuel Lerman,et al. Degrees of Unsolvability: Local and Global Theory , 1983 .

[14] Klaus Sutner,et al. A Note on Culik-Yu Classes , 1989, Complex Syst..