A Hierarchy of Fast Reversible Turing Machines
Reversible Turing machines with a working tape and a one-way or two-way read-only input tape are considered. We investigate the classes of languages acceptable by such devices with small time bounds in the range between real time and linear time, i.e., time bounds of the form \(n+r(n)\) where \(r\in o(n)\) is a sublinear function. It is shown that there exist infinite time hierarchies of separated complexity classes in that range. We then turn to the question of whether reversible Turing machines in the range of interest are weaker than general ones or not. This is answered in the affirmative by proving that there are languages accepted by irreversible one-way Turing machines in real time that cannot be accepted by any reversible one-way machine in less than linear time.
KeywordsReversible Turing machines Structural computational complexity Time hierarchies Fast computations Real time vs. linear time
Unable to display preview. Download preview PDF.
- 9.Li, M., Vitányi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications. Springer (1993)Google Scholar
- 10.Paul, W.J.: Komplexitätstheorie. Teubner (1978)Google Scholar
- 14.Vitányi, P.M.B.: Time, space, and energy in reversible computing. In: Bagherzadeh, N., Valero, M., Ramírez, A. (eds.) Computing Frontiers (CF 2005), pp. 435–444. ACM (2005)Google Scholar