Skip to main content
SpringerLink
Log in

On Aperiodic Reversible Turing Machines (Invited Talk)

  • Conference paper
  • First Online:
Reversible Computation (RC 2018)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 11106))

Included in the following conference series:

Abstract

A complete reversible Turing machine bijectively transforms configurations consisting of a state and a bi-infinite tape of symbols into another configuration by updating locally the tape around the head and translating the head on the tape. We discuss a simple machine with 4 states and 3 symbols that has no periodic orbit and how that machine can be embedded into other ones to prove undecidability results on decision problems related to dynamical properties of Turing machines.

The results presented in this talk were obtained in joint work with J. Cassaigne, A. Gajardo, J. Kari and R. Torres-Avilés.

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. Berger, R.: The Undecidability of the Domino Problem, vol. 66. Memoirs American Mathematical Society (1966)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Cassaigne, J., Ollinger, N., Torres-Avilés, R.: A small minimal aperiodic reversible Turing machine. J. Comput. Syst. Sci. 84, 288–301 (2017)

    Article  MathSciNet  Google Scholar 

  4. Gajardo, A., Ollinger, N., Torres-Avilés, R.: The transitivity problem of Turing machines. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 231–242. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48057-1_18

    Chapter  MATH  Google Scholar 

  5. Hooper, P.K.: The undecidability of the Turing machine immortality problem. J. Symbolic Logic 31(2), 219–234 (1966)

    Article  MathSciNet  Google Scholar 

  6. 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). https://doi.org/10.1007/978-3-540-85238-4_34

    Chapter  Google Scholar 

  7. Kari, J.: The nilpotency problem of one-dimensional cellular automata. SIAM J. Comput. 21(3), 571–586 (1992)

    Article  MathSciNet  Google Scholar 

  8. Kůrka, P.: On topological dynamics of Turing machines. Theoret. Comput. Sci. 174(1–2), 203–216 (1997)

    Article  MathSciNet  Google Scholar 

  9. Robinson, R.M.: Undecidability and nonperiodicity for tilings of the plane. Invent. Math. 12, 177–209 (1971)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Univ. Orléans, INSA Centre Val de Loire, LIFO EA 4022, 45067, Orléans, France

    Nicolas Ollinger

Authors
  1. Nicolas Ollinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nicolas Ollinger .

Editor information

Editors and Affiliations

  1. University of Turku, Turku, Finland

    Jarkko Kari

  2. University of Leicester, Leicester, United Kingdom

    Irek Ulidowski

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ollinger, N. (2018). On Aperiodic Reversible Turing Machines (Invited Talk). In: Kari, J., Ulidowski, I. (eds) Reversible Computation. RC 2018. Lecture Notes in Computer Science(), vol 11106. Springer, Cham. https://doi.org/10.1007/978-3-319-99498-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99498-7_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99497-0

  • Online ISBN: 978-3-319-99498-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation