Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies
We study cellular automata (CA) behavior in Besicovitch topology. We solve an open problem about the existence of transitive CA. The proof of this result has some interest in its own since it is obtained by using Kolmogorov complexity. At our knowledge it if the first result on discrete dynamical systems obtained using Kolmogorov complexity. We also prove that every CA (in Besicovitch topology) either has a unique fixed point or a countable set of periodic points. This result underlines that CA have a great degree of stability and may be considered a further step towards the understanding of CA periodic behavior.
KeywordsCellular Automaton Periodic Point Cellular Automaton Local Rule Kolmogorov Complexity
Unable to display preview. Download preview PDF.
- 3.Calude, C., Hertling, P., Jürgensen, H., Weihrauch, K.: Randomness on full shift spaces. Chaos, Solitons & Fractals 1, 1–13 (2000)Google Scholar
- 6.Delorme, M., Formenti, E., Mazoyer, J.: Open problems on cellular automata (2002) (submitted) Google Scholar
- 9.Durand, B.: Global properties of cellular automata. In: Goles, E., Martinez, S. (eds.) Cellular Automata and Complex Systems. Kluwer, Dordrecht (1998)Google Scholar
- 13.Martin, B.: Damage spreading and μ-sensitivity in cellular automata. Ergodic theory & dynammical systems (2002) (to appear)Google Scholar