Skip to main content
SpringerLink
Log in

On Immortal Configurations in Turing Machines

  • 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

We investigate the immortality problem for Turing machines and prove that there exists a Turing Machine that is immortal but halts on every recursive configuration. The result is obtained by combining a new proof of Hooper’s theorem [11] with recent results on effective symbolic dynamics.

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. Blondel, V.D., Cassaigne, J., Nichitiu, C.: On the presence of periodic configurations in Turing machines and in counter machines. Theoretical Computer Science 289(1), 573–590 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cenzer, D., Dashti, A., King, J.L.F.: Computable symbolic dynamics. Mathematical Logic Quarterly 54(5), 460–469 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cenzer, D., Remmel, J.: \(\Pi_1^0\) classes in mathematics. In: Handbook of Recursive Mathematics - Volume 2: Recursive Algebra, Analysis and Combinatorics. Studies in Logic and the Foundations of Mathematics, vol. 2, 139, ch. 13, pp. 623–821. Elsevier (1998)

    Google Scholar 

  4. Cenzer, D., Remmel, J.: Effectively Closed Sets. ASL Lecture Notes in Logic (2011) (in preparation)

    Google Scholar 

  5. Collins, P., van Schuppen, J.H.: Observability of Hybrid Systems and Turing Machines. In: 43rd IEEE conference on Decision and Control, pp. 7–12 (2004)

    Google Scholar 

  6. Delvenne, J.C., Blondel, V.D.: Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines. Theoretical Computer Science 319, 127–143 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hooper, P.K.: The Undecidability of the Turing Machine Immortality Problem. Journal of Symbolic Logic 31(2), 219–234 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jeandel, E., Vanier, P.: Turing degrees of multidimensional SFTs. submitted to Theoretical Computer Science, arXiv:1108.1012v2

    Google Scholar 

  9. Jockusch, C.G., Soare, R.I.: Degrees of members of \(\Pi_1^0\) classes. Pacific J. Math. 40(3), 605–616 (1972)

    MathSciNet  MATH  Google Scholar 

  10. Kari, J.: A small aperiodic set of Wang tiles. Discrete Mathematics 160, 259–264 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  11. 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 

  12. Kurka, P.: On topological dynamics of Turing machines. Theoretical Computer Science 174, 203–216 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lind, D.A., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, New York (1995)

    Book  MATH  Google Scholar 

  14. Miller, J.S.: Two Notes on subshifts. Proceedings of the American Mathematical Society 140(5), 1617–1622 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  15. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall (1967)

    Google Scholar 

  16. Myers, D.: Non Recursive Tilings of the Plane II. Journal of Symbolic Logic 39(2), 286–294 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  17. Simpson, S.G.: Mass problems associated with effectively closed sets. Tohoku Mathematical Journal 63(4), 489–517 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  18. Simpson, S.G.: Medvedev Degrees of 2-Dimensional Subshifts of Finite Type. Ergodic Theory and Dynamical Systems (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier, UMR 5506, CC 477, 161 rue Ada, 34095, Montpellier, Cedex 5, France

    Emmanuel Jeandel

Authors
  1. Emmanuel Jeandel
    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

Jeandel, E. (2012). On Immortal Configurations in Turing Machines. 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_34

Download citation

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

  • 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