Abstract
We show relations between new notions on cellular automata based on topological and measure-theoretical concepts: almost everywhere sensitivity to initial conditions for Besicovitch pseudo-distance, damage spreading (which measures the information (or damage) propagation) and the destruction of the initial con.guration information. Through natural examples, we illustrate the links between these formal de.nitions and Wolfram’s empirical classi.cation.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
F. Bagnoli, R. Rechtman, and S. Ru.o. Lyapunov exponents for cellular automata. InM.L pez de Haro and C. Varea, editors, Lectures on Thermodynamics ans Statistical Mechanics. World Scienti.c, 1994.
F. Blanchard, E. Formenti, and P. Kůrka. Cellular automata in the Cantor, Besicovitchand Weil topological spaces. Complex Systems, to appear 1999.
N. Boccara, J. Nasser, and M. Roger. Particle-like structures and their interactions in spatio-temporal patterns generated by one-dimensional deterministic cellularautomata rules. Physical Review A, 44:866–875, 1991.
C. Cattaneo, E. Formenti, L. Margara, and J. Mazoyer. Shift invariant distance on sZ withnon trivial topology. In Proceedings of MFCS’ 97. Springer Verlag, 1997.
G. Cattaneo, E. Formenti, L. Margara, and G. Mauri. Transformation of the one-dimensional cellular automata rule space. Parallel Computing, 23:1593–1611, 1997.
G. Cattaneo, E. Formenti, L. Margara, and G. Mauri. On the dynamical behavior of chaotic cellular automata. Theoretical Computer Science, 217:31–51, 1999.
R. H. Gilman. Classes of linear automata. Ergod. Th. & Dynam. Sys., 7:105–118, 1987.
J. E. Hanson and J. P. Crutch.eld. Computational mechanics of cellular automata: an example. Physica D, 103:169–189, 1997.
V. Kanovei and M. Reeken. On Ulam’s problem of approximation of non-exact homomorphisms. preprint, 2000.
P. Kurka and A. Maass. Stability of subshifts in cellular automata. preprint, 1999.
B. Martin. Damage spreading and μ-sensitivity on CA-extended to proofs. ResearchRep ort RR2000-04, LIP, ENS Lyon, 46 allée d’Italie-69 364 Lyon Cedex 07, 2000. ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2000/RR2000-04.ps.Z.
B. Martin. A group interpretation of particles generated by one dimensional cellular automaton, 54 wolfram’s rule. Int. Journ. of Mod. Phys. C, 11(1):101–123, 2000.
J. Mazoyer and I. Rapaport. Inducing an order on cellular automata by a grouping operation. In STACS’98, volume 1373, pages 116–127. Lecture Notes in Computer Science, 1998.
K. Culik, J. Pach, and S. Yu. On the limit set of cellular automata. SIAM Journal on Computing, 18:831–842, 1989.
S. Wolfram. Universality and complexity in cellular automata. Physica D, 10:1–35, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martin, B. (2000). Damage Spreading and μ-Sensitivity on Cellular Automata. In: van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P.D., Ito, T. (eds) Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics. TCS 2000. Lecture Notes in Computer Science, vol 1872. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44929-9_18
Download citation
DOI: https://doi.org/10.1007/3-540-44929-9_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67823-6
Online ISBN: 978-3-540-44929-4
eBook Packages: Springer Book Archive