Abstract
A new proof of a theorem of Hopcroft, Paul, and Valiant is presented: Every deterministic multitape Turing machine of time complexityT(n) can be simulated by a deterministic Turing machine of space complexityT(n)/logT(n). The proof includes an overlap argument.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Hopcroft, W. Paul, and L. Valiant, On time versus space,J. ACM, 24, 332–337 (1977).
J. E. Hopcroft and J. D. Ullman, Relations between time and tape complexities,J. ACM, 15, 414–427 (1968).
J. E. Hopcroft and J. D. Ullman,Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.
M. S. Paterson, Tape bounds for time-bounded Turing machines,J. Comp. Sys. Sci., 6, 116–124 (1972).
M. S. Paterson, M. J. Fischer, and A. R. Meyer, An improved overlap argument for on-line multiplication,Complexity of Computation, SIAM-AMS Proc. vol. 7, ed. R. Karp, Amer. Math. Soc., 1974, pp. 97–111.
W. J. Paul and R. Reischuk, On time versus space II,Proc. 20th Ann. Symp. on Foundations of Computer Science, 1979, pp. 298–206.
R. Reischuk, A fast implementation of a multidimensional storage into a tree storage,Proc. 7th Intern. Colloq. on Automata, Languages, and Programming, Springer-Verlag, 1980, pp. 531–542.
Author information
Authors and Affiliations
Additional information
Supported by National Science Foundation Grant No. MCS-78-04343.
Supported by National Science Foundation Grant No. MCS-77-19754 and the Fannie and John Hertz Foundation.
Rights and permissions
About this article
Cite this article
Adleman, L.M., Loui, M.C. Space-bounded simulation of multitape turing machines. Math. Systems Theory 14, 215–222 (1981). https://doi.org/10.1007/BF01752397
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01752397