Skip to main content

A Lyapunov View on the Stability of Two-State Cellular Automata

  • Chapter
Irreducibility and Computational Equivalence

Part of the book series: Emergence, Complexity and Computation ((ECC,volume 2))

Abstract

Although cellular automata (CAs) have been invented only about three quarter of a century ago, much has been written about the fascinating space-time patterns these utter discrete dynamical systems can bring forth, which can be largely attributed to the fact that it is striking to notice that the dynamics of these overly simple dynamical systems can be so intriguing. Driven by the advances in the theory of dynamical systems of continuous dynamical systems, several quantitative measures have been proposed to grasp the stability of CAs, among which the Lyapunov exponent (LE) has received particular attention. Originally, the latter was understood as the Hamming distance between configurations evolved by the same CA from different initially close configurations, but it suffers from the important drawback that it can grow only linearly over time. In this paper, it will be shown how one should determine the LE of a two-state CA, in such a way that its meaning is in line with the framework of continuous dynamical systems. Besides, the proposed methodology will be exemplified for two CA families.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baetens, J.M., De Baets, B.: Phenomenological study of irregular cellular automata based on Lyapunov exponents and Jacobians. Chaos 20, 33112 (2010)

    Article  Google Scholar 

  2. Baetens, J.M., De Baets, B.: Towards the full Lyapunov spectrum of elementary cellular automata. In: American Institute of Physics Conference Proceedings, Halkidiki, Greece, vol. 1389, p. 981 (2011)

    Google Scholar 

  3. Baetens, J.M., Van der Weeën, P., De Baets, B.: Effect of asynchronous updating on the stability of cellular automata. Chaos, Solitons and Fractals 45, 383–394 (2012)

    Article  Google Scholar 

  4. Bagnoli, F., Rechtman, R.: Thermodynamic entropy and chaos in a discrete hydrodynamical system. Physical Review E 79, 041115 (2009)

    Article  Google Scholar 

  5. Bagnoli, F., Rechtman, R., Ruffo, S.: Damage spreading and Lyapunov exponents in cellular automata. Physics Letters A 172, 34–38 (1992)

    Article  Google Scholar 

  6. Eckmann, J.-P., Ruelle, D.: Ergodic theory of chaos and strange attractors. Reviews of Modern Physics 57, 617–656 (1985)

    Article  MathSciNet  Google Scholar 

  7. Gardner, M.: Mathematical games: The fantastic combinations of John Conway’s new solitaire game ‘Life’. Scientific American 223, 120–123 (1970)

    Article  Google Scholar 

  8. Ilachinski, A. (ed.): Cellular Automata. A Discrete Universe. World Scientific, London (2001)

    MATH  Google Scholar 

  9. Langton, C.: Computation at the edge of chaos. Physica D 42, 12–37 (1990)

    Article  MathSciNet  Google Scholar 

  10. Lyapunov, A.M.: The general problem of the stability of motion. Taylor & Francis, London (1992)

    MATH  Google Scholar 

  11. Moore, E.F.: Machine models of self reproduction. In: Bellman, R.E. (ed.) Proceedings of the 14th Symposium in Applied Mathematics, New York, United States, pp. 17–33 (1992)

    Google Scholar 

  12. Oseledec, V.I.: A multiplicative ergodic theorem. Lyapunov characteristics numbers for dynamical systems. Transactions of the Moscow Mathematical Society 19, 197–231 (1968)

    MathSciNet  Google Scholar 

  13. Schrandt, R.G., Ulam, S.M.: On recursively defined geometrical objects and patterns of growth. Technical Report LA-3762, Los Alamos Scientific Laboratory (1968)

    Google Scholar 

  14. Ulam, S.M.: On some mathematical problems connected with patterns of growth of figures. In: Bellman, R.E. (ed.) Proceedings of the 14th Symposium in Applied Mathematics, New York, United States, pp. 215–224 (1968)

    Google Scholar 

  15. Vichniac, G.: Boolean derivatives on cellular automata. Physica D 45, 63–74 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  16. von Neumann, J.: The general and logical theory of automata. In: Jeffres, L.A. (ed.) The Hixon Symposium on Cerebral Mechanisms in Behaviour, pp. 1–41. John Wiley & Sons, Pasadena (1951)

    Google Scholar 

  17. von Neumann, J.: Theory of Self-Reproducing Automata. University of Illinois Press, Urbana (1966)

    Google Scholar 

  18. Wolfram, S.: Universality and complexity in cellular automata. Physica D 10, 1–35 (1984)

    Article  MathSciNet  Google Scholar 

  19. Wolfram, S.: A New Kind of Science. Wolfram Media, Inc., Champaign (2002)

    MATH  Google Scholar 

  20. Wuensche, A., Lesser, M.: The Global Dynamics of Cellular Automata, vol. 1. Addison-Wesley, London (1992)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Baetens, J.M., De Baets, B. (2013). A Lyapunov View on the Stability of Two-State Cellular Automata. In: Zenil, H. (eds) Irreducibility and Computational Equivalence. Emergence, Complexity and Computation, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35482-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35482-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35481-6

  • Online ISBN: 978-3-642-35482-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics