Abstract
We investigate the decidability of the periodicity and the immortality problems in three models of reversible computation: reversible counter machines, reversible Turing machines and reversible one-dimensional cellular automata. Immortality and periodicity are properties that describe the behavior of the model starting from arbitrary initial configurations: immortality is the property of having at least one non-halting orbit, while periodicity is the property of always eventually returning back to the starting configuration. It turns out that periodicity and immortality problems are both undecidable in all three models. We also show that it is undecidable whether a (not-necessarily reversible) Turing machine with moving tape has a periodic orbit.
Work supported by grants of the French ANR and Academy of Finland # 211967.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Landauer, R.: Irreversibility and heat generation in the computing process. IBM Journal of Research and Development 5, 183–191 (1961)
Lecerf, Y.: Machines de turing réversibles. C. R. Acad. Sci. Paris 257, 2597–2600 (1963)
Bennett, C.B.: Logical reversibility of computation. IBM Journal of Research and Development 17(6), 525–532 (1973)
Minsky, M.: Computation: Finite and Infinite Machines. Prentice Hall, Englewoods Cliffs (1967)
Morita, K.: Universality of a reversible two-counter machine. Theor. Comput. Sci. 168(2), 303–320 (1996)
Kari, J.: Theory of cellular automata: a survey. Theor. Comput. Sci. 334, 3–33 (2005)
Hooper, P.K.: The undecidability of the turing machine immortality problem. J. Symb. Log. 31(2), 219–234 (1966)
Collins, P., van Schuppen, J.H.: Observability of hybrid systems and turing machines. In: 43rd IEEE Conference on Decision and Control, vol. 1, pp. 7–12. IEEE Press, Los Alamitos (2004)
Kůrka, P.: On topological dynamics of turing machines. Theor. Comput. Sci. 174(1-2), 203–216 (1997)
Blondel, V.D., Cassaigne, J., Nichitiu, C.M.: On the presence of periodic configurations in turing machines and in counter machines. Theor. Comput. Sci. 289(1), 573–590 (2002)
Kari, J., Lukkarila, V.: Some undecidable dynamical properties for one-dimensional reversible cellular automata. In: Condon, A., Harel, D., Kok, J.N., Salomaa, A., Winfree, E. (eds.) Algorithmic Bioprocesses. Springer, Heidelberg (to appear, 2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kari, J., Ollinger, N. (2008). Periodicity and Immortality in Reversible Computing. In: Ochmański, E., Tyszkiewicz, J. (eds) Mathematical Foundations of Computer Science 2008. MFCS 2008. Lecture Notes in Computer Science, vol 5162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85238-4_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-85238-4_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85237-7
Online ISBN: 978-3-540-85238-4
eBook Packages: Computer ScienceComputer Science (R0)