Abstract
This paper presents improved time and space hierarchies of one-tape off-line Turing Machines (TMs), which have a single worktape and a two-way input tape: (i) For any time-constructible functions t 1 (n) and t 2(n) such that infn→∞ t 1(n) log log t 1(n)/t 2(n) = 0 and t 1(n) = nO(1), there is a language which can be accepted by a t 2(n)-time TM, but not by any t 1(n)-time TM. (ii) For any space-constructible function s(n) and positive constant ε, there is a language which can be accepted in space s(n) + log s(n) + (2 + ε) log log s(n) by a TM with two worktape-symbols, but not in space s(n) by any TM with the same worktape-symbols. The (log log t 1(n))-gap in (i) substantially improves the Hartmanis and Stearns' (log t 1(n))-gap which survived more than 30 years.
Preview
Unable to display preview. Download preview PDF.
References
M. Dietzfelbinger, The speed of copying on one-tape off-line Turing machines, IPL 33 (1989) 83–89.
M. Dietzfelbinger, W. Maass and G. Schnitger, The complexity of matrix transposition on one-tape off-line Turing machines, TCS 82 (1991) 113–129.
P.W. Dymond and M. Tompa, Speedups of deterministic machines by synchronous parallel machines, Proc. IEEE FOCS, 336–343, 1983.
M. Fürer, The tight deterministic time hierarchy, Proc. ACM STOC, 8–16, 1982.
V. Geffert, A speed-up theorem without tape compression, TCS 118 (1993) 49–65.
S. Gupta, Alternating time versus deterministic time: a separation, Proc. IEEE FOCS, 266–277, 1993.
J. Hartmanis, P.M. Lewis and R.E. Stearns, Classification of computations by time and memory requirements, Proc. IFIP Congress, 266–277, 1965.
J. Hartmanis and R.E. Stearns, On the computational complexity of algorithms, Trans. Amer. Math. Soc. 117 (1965) 285–306.
O.H. Ibarra, A hierarchy theorem for polynomial-space recognition, SIAM J. Comput. 3 3 (1974) 184–187.
O.H. Ibarra and S.K. Sahni, Hierarchies of Turing machines with restricted tape alphabet size, JCSS 11 (1975) 56–67.
O.H. Ibarra and S. Moran, Some time-space tradeoff results concerning single-tape and offline TM's, SIAM J. Comput. 12 2 (1983) 388–394.
M. Li, L. Longpré and P.M.B. Vitányi, The power of the queue, SIAM J. Comput. 21 4 (1992) 697–712.
M. Li and P.M.B. Vitányi, Tape versus queue and stacks: the lower bounds, Inform. and Comput. 78 (1988) 56–85.
M. LiŚkiewicz and K. LoryŚ, Fast simulations of time-bounded one-tape Turing machines by space-bounded ones, SIAM J. Comput. 19 3 (1990) 511–521.
W. Maass, Quadratic lower bounds for deterministic and nondeterministic one-tape Turing machines, Proc. IEEE FOCS, 401–408, 1984.
W. Maass and A. Schorr, Speed-up of Turing machines with one work tape and a two-way input tape, SIAM J. Comput. 16 1 (1987) 195–202.
W.J. Paul, N. Pippenger, E. Szemerédi, and W.T. Trotter, On determinism versus non-determinism and related problems, Proc. IEEE FOCS, 429–438, 1983.
W.J. Paul, On time hierarchies, JCSS 19 (1979) 197–202.
J.I. Seiferas, Techniques for separating space complexity classes, JCSS 14 (1977) 73–99.
J.I. Seiferas, Relating refined space complexity classes, JCSS 14 (1977) 100–129.
M. Sipser, Halting space-bounded computations, TCS 10 (1980) 335–338.
S. Žák, A Turing machine space hierarchy, Kybernetika, 26 2 (1979) 100–121.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwama, K., Iwamoto, C. (1998). Improved time and space hierarchies of one-tape off-line TMs. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055808
Download citation
DOI: https://doi.org/10.1007/BFb0055808
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64827-7
Online ISBN: 978-3-540-68532-6
eBook Packages: Springer Book Archive