We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Space-Bounded Simulation of Multitape Turing Machines

Thumbnail Image
Download
Name

MIT-LCS-TM-148.pdf

Size

2 MB

Format

Adobe PDF

Checksum (MD5)

204d8e9ba1ffb0a3d755173c77574881

Author(s)
Adleman, Leonard M.
•
Loui, Michael C.
Date Issued
January 1980
Series/Report no.
MIT-LCS-TM-148
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.