Skip to main content
SpringerLink
Log in

A Universal Cellular Automaton Without Sensitive Subsystems

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

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

  • 416 Accesses

Abstract

We construct a one-dimensional reversible cellular automaton that is computationally universal in a rather strong sense while being highly non-sensitive to initial conditions as a dynamical system. The cellular automaton has no sensitive subsystems. The construction is based on a simulation of a reversible Turing machine, where a bouncing signal activates the Turing machine to make single steps whenever the signal passes over the machine.

Research supported by the Academy of Finland Grant 131558.

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 EPUB and 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

References

  1. Banks, J., Brooks, J., Cairns, G., Davis, G., Stacey, P.: On devaney’s definition of chaos. Am. Math. Mon. 99(4), 332–334 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525–532 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  3. Delvenne, J.C., Kurka, P., Blondel, V.D.: Decidability and universality in symbolic dynamical systems. Fundam. Inform. 74(4), 463–490 (2006)

    MathSciNet  MATH  Google Scholar 

  4. Devaney, R.: An introduction to chaotic dynamical systems. Global analysis, pure and applied, Benjamin/Cummings (1986)

    Google Scholar 

  5. Kari, J., Ollinger, N.: Periodicity and immortality in reversible computing. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 419–430. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Kari, J., Salo, V., Törmä, I.: Trace complexity of chaotic reversible cellular automata. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 54–66. Springer, Heidelberg (2014)

    Google Scholar 

  7. Langton, C.G.: Computation at the edge of chaos: Phase transitions and emergent computation. Phys. D 42(1–3), 12–37 (1990)

    Article  MathSciNet  Google Scholar 

  8. Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible turing machine. Trans. IEICE Japan E72, 223–228 (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Turku, FI-20014, Turku, Finland

    Jarkko Kari

Authors
  1. Jarkko Kari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jarkko Kari .

Editor information

Editors and Affiliations

  1. University of Hyogo, Himeji, Japan

    Teijiro Isokawa

  2. Hiroshima University, Hiroshima, Japan

    Katsunobu Imai

  3. University of Hyogo, Himeji, Japan

    Nobuyuki Matsui

  4. National Institute of Information and Communications Technology, Osaka, Japan

    Ferdinand Peper

  5. Osaka Electro-Communication University, Osaka, Japan

    Hiroshi Umeo

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Kari, J. (2015). A Universal Cellular Automaton Without Sensitive Subsystems. In: Isokawa, T., Imai, K., Matsui, N., Peper, F., Umeo, H. (eds) Cellular Automata and Discrete Complex Systems. AUTOMATA 2014. Lecture Notes in Computer Science(), vol 8996. Springer, Cham. https://doi.org/10.1007/978-3-319-18812-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18812-6_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18811-9

  • Online ISBN: 978-3-319-18812-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation