Periodicity and Immortality in Reversible Computing

Authors:
Jarkko Kari;Nicolas Ollinger
Affiliations:
Department of Mathematics, University of Turku, Finland FIN-20014;Laboratoire d'informatique fondamentale de Marseille (LIF), Aix-Marseille Université, CNRS, Marseille, France 13013
Venue:
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Year:
2008

Citing 7
Cited 3

Universality of a reversible two-counter machine

Theoretical Computer Science - Special issue on universal machines and computations
On topological dynamics of Turing machines

Theoretical Computer Science
On the presence of periodic configurations in Turing machines and in counter machines

Theoretical Computer Science
Theory of cellular automata: a survey

Theoretical Computer Science
Computation: finite and infinite machines

Computation: finite and infinite machines
Irreversibility and heat generation in the computing process

IBM Journal of Research and Development
Logical reversibility of computation

IBM Journal of Research and Development

Note: The periodic domino problem revisited

Theoretical Computer Science
On time-symmetry in cellular automata

Journal of Computer and System Sciences
On immortal configurations in turing machines

CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes

Quantified Score

Hi-index	0.00

Visualization

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.