[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Everywhere Zero Pointwise Lyapunov Exponents for Sensitive Cellular Automata

  • Conference paper
  • First Online:
Cellular Automata and Discrete Complex Systems (AUTOMATA 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12286))

  • 295 Accesses

Abstract

Lyapunov exponents are an important concept in differentiable dynamical systems and they measure stability or sensitivity in the system. Their analogues for cellular automata were proposed by Shereshevsky and since then they have been further developed and studied. In this paper we focus on a conjecture claiming that there does not exist such a sensitive cellular automaton, that would have both the right and the left pointwise Lyapunov exponents taking the value zero, for each configuration. In this paper we prove this conjecture false by constructing such a cellular automaton, using aperiodic, complete Turing machines as a building block.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight 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

Similar content being viewed by others

References

  1. Blondel, V.D., Cassaigne, J., Nichitiu, C.M.: On the presence of periodic configurations in Turing machines and in counter machines. Theor. Comput. Sci. 289, 573–590 (2002)

    Article  MathSciNet  Google Scholar 

  2. Bressaud, X., Tisseur, P.: On a zero speed sensitive cellular automaton. Nonlinearity 20(1), 1–19 (2006). https://doi.org/10.1088/0951-7715/20/1/002

    Article  MathSciNet  MATH  Google Scholar 

  3. Cassaigne, J., Ollinger, N., Torres, R.: A small minimal aperiodic reversible Turing machine. J. Comput. Syst. Sci. 84 (2014). https://doi.org/10.1016/j.jcss.2016.10.004

  4. D’amico, M., Manzini, G., Margara, L.: On computing the entropy of cellular automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 470–481. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0055076

    Chapter  MATH  Google Scholar 

  5. Finelli, M., Manzini, G., Margara, L.: Lyapunov exponents vs expansivity and sensitivity in cellular automata. In: Bandini, S., Mauri, G. (eds.) ACRI 1996, pp. 57–71. Springer, London (1997). https://doi.org/10.1007/978-1-4471-0941-9_6

    Chapter  Google Scholar 

  6. Greiner, W.: Lyapunov exponents and chaos. In: Greiner, W. (ed.) Classical Mechanics, pp. 503–516. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-03434-3_26

    Chapter  Google Scholar 

  7. Guillon, P., Salo, V.: Distortion in one-head machines and cellular automata. In: Dennunzio, A., Formenti, E., Manzoni, L., Porreca, A.E. (eds.) Cellular Automata and Discrete Complex Systems, pp. 120–138. Springer International Publishing, Cham (2017). https://doi.org/10.1007/978-3-319-58631-1_10

    Chapter  MATH  Google Scholar 

  8. Jeandel, E.: Computability of the entropy of one-tape Turing machines. Leibniz International Proceedings in Informatics, LIPIcs 25 (2013). https://doi.org/10.4230/LIPIcs.STACS.2014.421

  9. Kůrka, P.: Topological dynamics of cellular automata. In: Meyers, R.A. (ed.) Encyclopedia of Complexity and Systems Science, pp. 9246–9268. Springer, New York (2009). https://doi.org/10.1007/978-0-387-30440-3_556

    Chapter  Google Scholar 

  10. Kůrka, P.: On topological dynamics of Turing machines. Theor. Comput. Sci. 174(1), 203–216 (1997). https://doi.org/10.1016/S0304-3975(96)00025-4. http://www.sciencedirect.com/science/article/pii/S0304397596000254

    Article  MathSciNet  MATH  Google Scholar 

  11. Lyapunov, A.: General Problem of the Stability of Motion. Control Theory and Applications Series. Taylor & Francis (1992). https://books.google.fi/books?id=4tmAvU3_SCoC

  12. Shereshevsky, M.A.: Lyapunov exponents for one-dimensional cellular automata. J. Nonlinear Sci. 2(1), 1–8 (1992). https://doi.org/10.1007/BF02429850

    Article  MathSciNet  MATH  Google Scholar 

  13. Tisseur, P.: Cellular automata and Lyapunov exponents. Nonlinearity 13(5), 1547–1560 (2000). https://doi.org/10.1088/0951-7715/13/5/308

    Article  MathSciNet  MATH  Google Scholar 

  14. Wolfram, S.: Universality and complexity in cellular automata. Phys. D Nonlinear Phenom. 10(1), 1–35 (1984). https://doi.org/10.1016/0167-2789(84)90245-8. http://www.sciencedirect.com/science/article/pii/0167278984902458

    Article  MathSciNet  MATH  Google Scholar 

  15. Wolfram, S.: Twenty problems in the theory of cellular automata. Phys. Scr. T9, 170–183 (1985). https://doi.org/10.1088/0031-8949/1985/t9/029

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The author acknowledges the emmy.network foundation under the aegis of the Fondation de Luxembourg for its financial support.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Toni Hotanen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hotanen, T. (2020). Everywhere Zero Pointwise Lyapunov Exponents for Sensitive Cellular Automata. In: Zenil, H. (eds) Cellular Automata and Discrete Complex Systems. AUTOMATA 2020. Lecture Notes in Computer Science(), vol 12286. Springer, Cham. https://doi.org/10.1007/978-3-030-61588-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-61588-8_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-61587-1

  • Online ISBN: 978-3-030-61588-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics