Some results about the chaotic behavior of cellular automata

We study the behavior of cellular automata (CA for short) in the Cantor, Besicovitch and Weyl topologies. We solve an open problem about the existence of transitive CA in the Besicovitch topology. The proof of this result has some interest of its own since it is obtained by using Kolmogorov complexity. To our knowledge it is the first result about discrete dynamical systems obtained using Kolmogorov complexity. We also prove that in the Besicovitch topology every CA has either a unique periodic point (thus a fixed point) or an uncountable set of periodic points. This result underlines the fact that CA have a great degree of stability; it may be considered a further step towards the understanding of CA periodic behavior.Moreover, we prove that in the Besicovitch topology there is a special set of configurations, the set of Toeplitz configurations, that plays a role similar to that of spatially periodic configurations in the Cantor topology, that is, it is dense and has a central role in the study of surjectivity and injectivity. Finally, it is shown that the set of spatially quasi-periodic configurations is not dense in the Weyl topology.

[1]  Stephen Wolfram,et al.  Theory and Applications of Cellular Automata , 1986 .

[2]  J. Silver,et al.  Counting the number of equivalence classes of Borel and coanalytic equivalence relations , 1980 .

[3]  Enrico Formenti,et al.  On the sensitivity of additive cellular automata in Besicovitch topologies , 2003, Theor. Comput. Sci..

[4]  Mike Boyle,et al.  Periodic points for onto cellular automata , 1999 .

[5]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[6]  Masakazu Nasu,et al.  Textile systems for endomorphisms and automorphisms of the shift , 1995 .

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

[8]  William I. Gasarch,et al.  Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.

[9]  Eric Goles,et al.  Cellular automata and complex systems , 1999 .

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

[11]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[12]  Cristian S. Calude,et al.  Randomness on full shift spaces , 2001 .

[13]  W. Parry.  Symbolic dynamics and transformations of the unit interval , 1966 .

[14]  Bruno Durand,et al.  Global Properties of Cellular Automata , 1999 .

[15]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[17]  Bruno Martin,et al.  Damage spreading and $\mu$-sensitivity on cellular automata , 2000, Ergodic Theory and Dynamical Systems.

[18]  François Blanchard,et al.  Dynamical properties of expansive one-sided cellular automata , 1997 .

[19]  Erica Jen,et al.  Global properties of cellular automata , 1986 .

[20]  Carsten Knudsen,et al.  Chaos Without Nonperiodicity , 1994 .

[21]  Enrico Formenti,et al.  Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies , 2003, MFCS.

[22]  Enrico Formenti,et al.  Kolmogorov complexity and cellular automata classification , 2001, Theor. Comput. Sci..

[23]  Martin Stein.  Interpretations of Heyting's arithmetic—An analysis by means of a language with set symbols ☆ , 1980 .

[24]  Enrico Formenti,et al.  On undecidability of equicontinuity classification for cellular automata , 2003, DMCS.

[25]  Pierre Tisseur,et al.  Some properties of cellular automata with equicontinuity points , 2000 .

[26]  P. Kurka.  Languages, equicontinuity and attractors in cellular automata , 1997, Ergodic Theory and Dynamical Systems.

[27]  R. Devaney.  An Introduction to Chaotic Dynamical Systems , 1990 .

[28]  Petr Kurka,et al.  Cellular Automata in the Cantor, Besicovitch, and Weyl Topological Spaces , 1997, Complex Syst..

[29]  Gianpiero Cattaneo,et al.  Pattern Growth in Elementary Cellular Automata , 1995, Theor. Comput. Sci..

[30]  Gianpiero Cattaneo,et al.  A Shift-Invariant Metric on Szz Inducing a Non-trivial Tolology , 1997, MFCS.

[31]  Enrico Formenti,et al.  Algorithmic Information Theory and Cellular Automata Dynamics , 2001, MFCS.

[32]  Giovanni Manzini.  Characterization of Sensitive Linear Cellular Automata with Respect to the Counting Distance , 1998, MFCS.

[33]  Alejandro Maass,et al.  Limit Sets of Cellular Automata Associated to Probability Measures , 2000 .