Space-Bounded Simulation of Multitape Turing Machines

Author(s)
Adleman, Leonard M.; Loui, Michael C.
Thumbnail
DownloadMIT-LCS-TM-148.pdf (1.997Mb)
Metadata
Show full item record
Abstract
A new proof of a theorem of Hopcroft, Paul, and Valiant is presented: every deterministic multitape Turing machine of time complexity T(n) can be simulated by a deterministic Turing machine of space complexity T(n)/log T(n). The proof includes an overlap argument.
Date issued
1980-01
URI
https://hdl.handle.net/1721.1/148975
Series/Report no.
MIT-LCS-TM-148
Collections