Cellular automata and intermediate degrees

Theoretical Computer Science

Volumn 296, Issue 2, 2003, Pages 365-375

  Sutner, K ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Cellular automata; Intermediate degrees

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECISION THEORY; PROBLEM SOLVING;

CELLULAR AUTOMATA;

TURING MACHINES;

EID: 0037426284     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00661-8     Document Type: Conference Paper

References (14)

1. Baldwin J.T., Shelah S. On the classifiability of cellular automata. Theoret. Comput. Sci. 230(1-2):2000;117-129.
2. Culik K. II, Sheng Yu Undecidability of CA classification schemes. Complex Systems. 2(2):1988;177-190.
3. Davis M. A Note on Universal Turing Machines. 1956;172-175 Princeton University Press, Princeton, NJ.
4. Lerman M. Degrees of Unsolvability, Perspectives in Mathematical Logic. 1983;Springer, Berlin.
5. Shepherdson J.C. Machine configuration and word problems of given degree of unsolvability. Z. Math. Logik Grundlag. Math. 11:1965;149-175.
6. R.A. Shore, The Recursively Enumerable Degrees, vol. 140 of Studies in Logic, North-Holland, 1999, pp. 169-197 (Chapter 6).
7. Soare R.I. Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic. 1987;Springer, Berlin.
8. Sutner K. Cellular automata and intermediate reachability problems. Fundamenta Informaticae. 52:2002;1-8.
9. Sutner K. A note on Culik-Yu classes. Complex Systems. 3(1):1989;107-115.
10. Sutner K. Classifying circular cellular automata. Physica D. 45(1-3):1990;386-395.
11. Wolfram S. Computation theory of cellular automata. Comm. Math. Phys. 96(1):1984a;15-57.
12. Wolfram S. Universality and complexity in cellular automata. Physica D. 10:1984b;1-35.
13. Wolfram S. The Mathematica Book. 4th Edition:1999;Wolfram Media, Cambridge UP.
14. Wolfram S. A New Kind of Science. 2002;Wolfram Media, Cambridge, UP.