Skip to main content
SpringerLink
Log in

Densities and Entropies in Cellular Automata

  • Conference paper
How the World Computes (CiE 2012)

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

Included in the following conference series:

Abstract

Following work by Hochman and Meyerovitch on multidimensional SFT, we give computability-theoretic characterizations of the real numbers that can appear as the topological entropies of one-dimensional and two-dimensional cellular automata.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Čulik II, K., Hurd, L.P., Kari, J.: The topological entropy of cellular automata is uncomputable. Ergodic Theory & Dynamical Systems 12(2), 255–265 (1992)

    MATH  Google Scholar 

  2. Durand, B., Romashchenko, A., Shen, A.: Fixed-point tile sets and their applications (September 2010), draft

    Google Scholar 

  3. Gács, P.: Reliable cellular automata with self-organization. Journal of Statistical Physics 102(1-2), 45–267 (2001), http://www.cs.bu.edu/fac/gacs/recent-publ.html

    Article  Google Scholar 

  4. Guillon, P., Zinoviadis, C.: Densities and entropies in cellular automata (2012), arXiv:1204.0949

    Google Scholar 

  5. Hochman, M.: On the dynamics and recursive properties of multidimensional symbolic systems. Inventiones Mathematicæ 176(1), 131–167 (2009), http://www.springerlink.com/content/h66428l759545081

    Article  MathSciNet  MATH  Google Scholar 

  6. Hochman, M.: Expansive directions for \(\mathbb{z}\) actions. Ergodic Theory & Dynamical Systems 31(1), 91–112 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hochman, M., Meyerovitch, T.: A characterization of the entropies of multidimensional shifts of finite type. Annals of Mathematics 171(3), 2011–2038 (2010), http://pjm.math.berkeley.edu/annals/ta/080814-Hochman/080814-Hochman-v1.pdf

    Article  MathSciNet  MATH  Google Scholar 

  8. Kari, J.: The nilpotency problem of one-dimensional cellular automata. SIAM Journal on Computing 21(3), 571–586 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  9. Milnor, J.: On the entropy geometry of cellular automata. Complex Systems 2(3), 357–385 (1988)

    MathSciNet  MATH  Google Scholar 

  10. Mozes, S.: Tilings, substitution systems and dynamical systems generated by them. Journal d’analyse mathématique 53, 139–186 (1988)

    Article  MathSciNet  Google Scholar 

  11. Park, K.K.: Entropy of a skew product with a \(\mathbb{z}^2\) -action. Pacific Journal of Mathematics 172(1), 227–241 (1996), http://projecteuclid.org/euclid.pjm/1102366193

    MathSciNet  MATH  Google Scholar 

  12. Robinson, R.M.: Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicæ 12(3) (1971)

    Google Scholar 

  13. Simonsen, J.G.: On the computability of the topological entropy of subshifts. Discrete Mathematics & Theoretical Computer Science 8, 83–96 (2006), www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/download/456/1602

    MathSciNet  MATH  Google Scholar 

  14. Zheng, X., Weihrauch, K.: The Arithmetical Hierarchy of Real Numbers. In: Kutyłowski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 23–33. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, 20014, Turku, Finland

    Pierre Guillon & Charalampos Zinoviadis

  2. CNRS & Institut de Mathématiques de Luminy, Campus de Luminy, Case 907, 13288, Marseille cedex 9, France

    Pierre Guillon

Authors
  1. Pierre Guillon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Charalampos Zinoviadis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Mathematics, University of Leeds, LS2 9JT, Leeds, UK

    S. Barry Cooper

  2. Computer Laboratory, University of Cambridge, Willialm Gates Building, J.J. Thomson Avenue, CB3 0FD, Cambridge, UK

    Anuj Dawar

  3. Institute for Logic, Language and Computation, University of Amsterdam, 1090 GE, Amsterdam, The Netherlands

    Benedikt Löwe

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guillon, P., Zinoviadis, C. (2012). Densities and Entropies in Cellular Automata. In: Cooper, S.B., Dawar, A., Löwe, B. (eds) How the World Computes. CiE 2012. Lecture Notes in Computer Science, vol 7318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30870-3_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30870-3_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30869-7

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation