Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > Periodicity and Immortality in...

Periodicity and Immortality in Reversible Computing

Jarkko Kari, Nicolas Ollinger, Periodicity and Immortality in Reversible Computing. In: Edward Ochmanski, Jerzy Tyszkiewicz (Eds.), Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, Lecture Notes in Computer Science 5162, 419–430, Springer, 2008.

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.

BibTeX entry:

@INPROCEEDINGS{inpKaOl08a,
  title = {Periodicity and Immortality in Reversible Computing},
  booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings},
  author = {Kari, Jarkko and Ollinger, Nicolas},
  volume = {5162},
  series = {Lecture Notes in Computer Science},
  editor = {Ochmanski, Edward and Tyszkiewicz, Jerzy},
  publisher = {Springer},
  pages = {419–430},
  year = {2008},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 1

Edit publication