Advertisement

Some Undecidable Dynamical Properties for One-Dimensional Reversible Cellular Automata

  • Jarkko KariEmail author
  • Ville Lukkarila
Chapter
Part of the Natural Computing Series book series (NCS)

Abstract

Using the fact that the tiling problem of Wang tiles is undecidable even if the given tile set is deterministic by two opposite corners, it is shown that the question whether there exists a trajectory which belongs to the given open and closed set is undecidable for one-dimensional reversible cellular automata. This result holds even if the cellular automaton is mixing. Furthermore, it is shown that left expansivity of a reversible cellular automaton is an undecidable property. Also, the tile set construction gives yet another proof for the universality of one-dimensional reversible cellular automata.

Keywords

Cellular Automaton Turing Machine Color Pair Tiling Problem Global Rule 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Amoroso S, Patt Y (1972) Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. J Comput Syst Sci 6:448–464 zbMATHMathSciNetGoogle Scholar
  2. 2.
    Bennett CH (1973) Logical reversibility of computation. IBM J Res Dev 6:525–532 Google Scholar
  3. 3.
    Berger R (1966) The undecidability of the domino problem. Mem Am Math Soc 66:1–72 Google Scholar
  4. 4.
    Blanchard F, Maass A (1997) Dynamical properties of expansive one-sided cellular automata. Israel J Math 99:149–174 zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Dubacq J-C (1995) How to simulate any Turing machine by reversible one-dimensional cellular automaton. Int J Found Comput Sci 6(4):395–402 zbMATHCrossRefGoogle Scholar
  6. 6.
    Durand B, Formenti E, Varouchas G (2003) On undecidability of equicontinuity classification for cellular automata. Discrete Math Theor Comput Sci, pp 117–128 Google Scholar
  7. 7.
    Finelli M, Manzini G, Margara L (1998) Lyapunov exponents versus expansivity and sensitivity in cellular automata. J Complex 14:210–233 zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Hooper P (1966) The undecidability of the Turing machine immortality problem. J Symbol Log 31(2):219–234 zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages and computation. Addison–Wesley, Readings zbMATHGoogle Scholar
  10. 10.
    Kari J (1992) The nilpotency problem of one-dimensional cellular automata. SIAM J Comput 21:571–586 zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Kari J (1994) Reversibility and surjectivity problems of cellular automata. J Comput Syst Sci 48:149–182 zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Kari J (2005) Theory of cellular automata: a survey. Theor Comput Sci 334:3–33 zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Kari J, Ollinger N (2008) Periodicity and immortality in reversible computing. In: MFCS 2008. Lecture notes in computer science, vol 5162. Springer, Berlin, pp 419–430 Google Scholar
  14. 14.
    Kurka P (2001) Topological dynamics of cellular automata. In: Markus B, Rosenthal J (eds) Codes, systems and graphical models. IMA volumes in mathematics and its applications, vol 123. Springer, Berlin, pp 447–498 Google Scholar
  15. 15.
    Lukkarila V (2008) Sensitivity and topological mixing are undecidable for reversible one-dimensional cellular automata. J Cell Autom (submitted) Google Scholar
  16. 16.
    Lukkarila V (2009) The 4-way deterministic tiling problem is undecidable. Theor Comput Sci 410:1516–1533 zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Manna Z (1974) Mathematical theory of computation. McGraw–Hill, New York zbMATHGoogle Scholar
  18. 18.
    Morita K, Harao M (1989) Computation universality of one-dimensional reversible (injective) cellular automata. Trans IEICE Jpn E72:758–762 Google Scholar
  19. 19.
    Nasu M (1995) Textile systems for endomorphisms and automorphisms of the shift. Mem Am Math Soc, vol 546. AMS, Providence Google Scholar
  20. 20.
    Robinson RM (1971) Undecidability and nonperiodicity for tilings of the plane. Invent Math 12:177–209 CrossRefMathSciNetGoogle Scholar
  21. 21.
    Shereshevsky MA (1993) Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms. Indag Math N S 4:203–210 zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Department of MathematicsUniversity of TurkuTurkuFinland
  2. 2.Turku Centre for Computer ScienceTurkuFinland

Personalised recommendations