Kolmogorov complexity and cellular automata classification

Theoretical Computer Science

Volumn 259, Issue 1-2, 2001, Pages 271-285

  Dubacq, J C ^a   Durand, B ^a   Formenti, E ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; RANDOM PROCESSES;

CELLULAR AUTOMATA CLASSIFICATION; KOLMOGOROV COMPLEXITY;

AUTOMATA THEORY;

EID: 0034918352     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00012-8     Document Type: Article

References (23)

1. On Devaney's definition of chaos
2. Topological and measure-theoretic properties of one-dimensional cellular automata
3. Pattern growth in elementary cellular automata
4. Z inducing a non-trivial topology
5. Revisting the edge of chaos: Evolving cellular automata to perform computations
6. On the limit set of cellular automata
7. The game of life: Universality revisited
8. Mean field theory and the edge of chaos
9. Endomorphism and automorphism of the shift dynamical systems
10. Attractors in cellular automata
11. Rice's theorem for the limit set of cellular automata
12. Chaos without nonperiodicity
13. Languages, equicontinuity and attractors in cellular automata
14. Computation at the edge of chaos: Phase transitions and emergent computation
15. The definition of random sequences
16. Complexity oscillations in infinite binary sequences
17. Can individual sequences of zeros and ones be random?
18. Relations between varieties of Kolmogorov complexities
19. Computation theory of cellular automata