A reversible Turing machine (RTM) is a basic model for studying computational universality, and computational complexity in reversible computing. In this chapter, after giving definitions on RTMs, we explain the method of Bennett for constructing a three-tape RTM that simulates a given irreversible TM. By this, computational universality of the class of three-tape RTMs is derived. We then clarify basic properties of RTMs, and study several variations of RTMs. In particular, we give simplification methods for RTMs. They are methods for reducing the number of tapes, the number of tape symbols, and the number of states of RTMs. From them, the computational universality of one-tape two-symbol RTMs with one-way infinite tape, and one-tape three state RTMs is derived. These results are useful for showing the computational universality of other reversible systems, and for composing reversible computing machines out of reversible logic elements.
- reversible Turing machine
- quadruple formulation
- quintuple formulation
- computational universality
- simplification of Turing machine
This is a preview of subscription content, access via your institution.
Tax calculation will be finalised at checkout
Purchases are for personal use onlyLearn about institutional subscriptions
Unable to display preview. Download preview PDF.
© 2017 Springer Japan KK
About this chapter
Cite this chapter
Morita, K. (2017). Reversible Turing Machines. In: Theory of Reversible Computing. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Tokyo. https://doi.org/10.1007/978-4-431-56606-9_5
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-56604-5
Online ISBN: 978-4-431-56606-9