Abstract
We construct a universal reversible Turing machine (URTM) from first principles. We take a strict approach to the semantics of reversible Turing machines (RTMs), under which they can compute exactly all injective, computable functions, but not non-injective ones. The natural notion of universality for RTMs is RTM-universality, where programs are considered part of both input and output of a URTM. The machine described here is the first URTM which does not depend on reversibilizing any existing universal machine. The interpretive overhead of the URTM is limited to a (program dependent) constant factor slowdown, with no other complexity-wise cost wrt time and space. The URTM is also able to function as an inverse interpreter for RTMs at no asymptotic cost, simply by reversing the string representing the interpreted machine.
| Original language | English |
|---|---|
| Title of host publication | Language and Automata Theory and Applications : 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings |
| Editors | Adrian-Horia Dediu, Shunsuke Inenaga, Carlos Martín-Vide |
| Number of pages | 12 |
| Publisher | Springer |
| Publication date | 2011 |
| Pages | 117-128 |
| ISBN (Print) | 978-3-642-21253-6 |
| ISBN (Electronic) | 978-3-642-21254-3 |
| DOIs | |
| Publication status | Published - 2011 |
| Event | 5th International Conference on Language and Automata Theory and Applications - Tarragona, Spain Duration: 26 May 2011 → 31 May 2011 Conference number: 5 |
Conference
| Conference | 5th International Conference on Language and Automata Theory and Applications |
|---|---|
| Number | 5 |
| Country/Territory | Spain |
| City | Tarragona |
| Period | 26/05/2011 → 31/05/2011 |
| Series | Lecture notes in computer science |
|---|---|
| Volume | 6638 |
| ISSN | 0302-9743 |