Skip to main content
SpringerLink
Log in

Characterisation of Limit Measures of Higher-Dimensional Cellular Automata

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We consider the typical asymptotic behaviour of cellular automata of higher dimension (≥2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular automaton, and consider the (set of) limit probability measure(s) as t → ∞. In this paper, we prove that limit measures that can be reached by higher-dimensional cellular automata are completely characterised by computability conditions, as in the one-dimensional case. This implies that cellular automata have the same variety and complexity of typical asymptotic behaviours as Turing machines, and that any nontrivial property in this regard is undecidable (Rice-type theorem). These results extend to connected sets of limit measures and Cesàro mean convergence. The main tool is the implementation of arbitrary computation in the time evolution of a cellular automata in such a way that it emerges and self-organises from a random configuration.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Ballier, A., Guillon, P., Kari, J.: Limit sets of stable and unstable cellular automata. Fundamenta Informaticae 110(1-4), 45–57 (2011)

    MathSciNet  MATH  Google Scholar 

  2. Boyer, L., Delacourt, M., Poupet, V., Sablik, M., Theyssier, G.: μ-limit sets of cellular automata from a computational complexity perspective. J. Comput. Syst. Sci. 81(8), 1623–1647 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  3. Boyer, L., Delacourt, M., Sablik, M.: Construction of μ-limit sets In: Proc. JAC 2010, pp. 76–87 (2010)

  4. Boyer, L., Poupet, V., Theyssier, G.: On the complexity of limit sets of cellular automata associated with probability measures In: Proc. MFCS 2006, pp. 190–201 (2006)

  5. Delacourt, M.: Rice’s theorem for μ-limit sets of cellular automata In: Proc. ICALP 2011 (2), pp. 89–100 (2011)

  6. Delacourt, M.: Hellouin de Menibus, B.: Construction of μ-limit sets of two-dimensional cellular automata In: Proc. STACS 2015, pp. 262–274 (2015)

  7. Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical system. Math. Syst. Theory 3(4), 320–375 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hellouin de Menibus, B.: Asymptotic behaviour of cellular automata: computation and randomness. Aix-Marseille University, Ph.D. thesis (2010)

  9. Hellouinde Menibus, B., Sablik, M.: Characterisation of sets of limit measures after iteration of a cellular automaton on an initial measure (2013). Accepted to Ergodic Theory and Dynamical Systems

  10. Kari, J.: Rice’s theorem for the limit sets of cellular automata. Theor. Comput. Sci. 127, 229–254 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kari, J., Taati, S.: Statistical mechanics of surjective cellular automata. J. Stat. Phys. 160(5), 1198–1243 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kůrka, P., Maass, A.: Limit sets of cellular automata associated to probability measures. J. Stat. Phys. 100(5-6), 1031–1047 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Maass, A.: On the sofic limit sets of cellular automata. Ergodic Theory and Dynamical Systems 15(4), 663–684 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  14. von Neumann, J.: Theory of self-reproducing automata. University of Illinois Press (1966)

  15. Petersen, K.: Ergodic theory, Cambridge Studies in Advanced Mathematics, vol. 2. Cambridge University Press (1983)

  16. Zheng, X., Weihrauch, K.: The arithmetical hierarchy of real numbers. Math. Log. Q. 47(1), 51–65 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ziegler, M.: Computability and continuity on the real arithmetic hierarchy and the power of type-2 nondeterminism In: Proc. CiE 2005, pp. 562–571 (2005)

Download references

Author information

Authors and Affiliations

  1. CMM, Universidad de Chile, CNRS, Av. Blanco Encalada 2120, Santiago, Chile

    Martin Delacourt & Benjamin Hellouin de Menibus

  2. Departamento de Matemáticas, Universidad Andres Bello, Santiago, Chile

    Benjamin Hellouin de Menibus

Authors
  1. Martin Delacourt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benjamin Hellouin de Menibus
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin Delacourt.

Additional information

Research partially supported by the FONDECYT Postdoctorado Proyecto 3130496 and by Basal project No. PFB-03 CMM, Universidad de Chile

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Delacourt, M., Hellouin de Menibus, B. Characterisation of Limit Measures of Higher-Dimensional Cellular Automata. Theory Comput Syst 61, 1178–1213 (2017). https://doi.org/10.1007/s00224-017-9753-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-017-9753-1

Keywords

Search

Navigation