Abstract
It is shown that if a language L is recognized by a (nondeterministic) single-tape Turing machine of time complexity T(n), then L is recognized by a (nondeterministic) offline Turing machine of tape complexity T1/2(n). If T(n) 蠅 n2;, L is recognized by a (nondeterministic) single-tape Turing machine of tape complexity T1/2(n). If a language L is recognized by a (nondeterministic) offline Turing machine of time complexity (T(n), then L is recognized by a (nondeterministic) offline Turing machine of tape complexity (T(n) log n)1/2 and by a (nondeterministic) single-tape Turing machine of that tape complexity if T (n) 蠅 n2/log n. © 1968, ACM. All rights reserved.
Cite
CITATION STYLE
Hopcroft, J. E., & Ullman, J. D. (1968). Relations Between Time and Tape Complexities. Journal of the ACM (JACM), 15(3), 414–427. https://doi.org/10.1145/321466.321474
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
