Abstract
We shall show that each nondeterministic single-tape Turing machine of time complexity T(n) ≥ n2 can be replaced by an equivalent k times faster nondeterministic machine writing only zeroes and ones on its tape, for each k ≥ 1. Therefore, nondeterministic single-tape Turing machines do not require the tape compression for speeding-up.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Hartmanis, R.E. Stearns: On the computational complexity of algorithms, Trans. Amer. Math. Soc., 117, 1965, 285–306
M.Liśkiewicz, K.Loryś: Fast simulations of time-bounded one-tape TM's by space-bounded ones, Technical Report N-187, Wrocław University, August 1987
M. Liśkiewicz, K. Loryś: Two applications of Fürer's counter to one-tape nondeterministic TM's, Proceedings of MFCS'88, LNCS 324, Springer-Verlag 1988, 445–453
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geffert, V. (1990). Speed-up theorem without tape compression. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029620
Download citation
DOI: https://doi.org/10.1007/BFb0029620
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52953-8
Online ISBN: 978-3-540-47185-1
eBook Packages: Springer Book Archive