On the classifiability of cellular automata

Theoretical Computer Science

Volumn 230, Issue 1-2, 2000, Pages 117-129

  Baldwin, John T ^a   Shelah, Saharon ^b,c  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

Cellular automata; Classification; Turing machines

Indexed keywords

EID: 0000311275     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00042-0     Document Type: Article

References (10)

1. A. Dhar, P. Lakdala, G. Mandai, S.R. Wadia, Role of initial conditions in the classification of the rule space of cellular automata dynamics, Phys. Rev. E 51 (1995) 3032-3037.
2. Braga et al., Pattern growth in elementary ca, Theoret. Comput. Sci. 145 (1995) 1-26.
3. L. Hurd, Formal language characterization of cellular automaton limit sets, Complex Systems 1 (1987) 69-80.
4. K. Culik III, S. Yu, Undecidability of ca classification schemes, Complex Systems 2 (1988) 177.
5. M. Land, R.K. Belew, No perfect two-state cellular automata for density classification exists, Phys. Rev. Lett. 74 (1995) 5148-5150.
6. J.C. Shepherdson, Machine configuration and word problems of given degree of unsolvability, Zeitschrift f. Math. Logik u. Grundlagen d. Mathematik 11 (1965) 149-175.
7. S. Ishii, Measure theoretic approach to the classification of cellular automata, Discrete Appl. Math. 39 (1992) 125-136.
8. K. Sutner, A note on Culik-Yu classes, Complex Systems 3 (1989) 107.
9. S. Wolfram, Computation theory of cellular automata, in: Cellular Automata and Complexity, Addison-Wesley, Reading, MA, 1994, pp. 159-202. Originally published: Comm. Math. Phys. 96 (1984) 15-57.
10. S. Wolfram, Computation theory of cellular automata, in: Cellular Automata and Complexity, Addison- Wesley, Reading, MA, 1994, pp. 159-202. Originally published: Comm. Math. Phys. 96 (1984) 15-57.