A Space Bound for One-tape Multidimensional Turing Machines

Author(s)
Loui, Michael C.
Thumbnail
DownloadMIT-LCS-TM-145.pdf (2.707Mb)
Metadata
Show full item record
Abstract
Let L be a language recognized by a nondeterministic Turing machine with one d-dimensional worktape of time complexity T(n). Then L can be recognized by a deterministic Turing machine of space complexity (T(n)logT(n))^d/d+1. The prood employs a generalized crossing sequence argument.
Date issued
1979-11
URI
https://hdl.handle.net/1721.1/148972
Series/Report no.
MIT-LCS-TM-145
Collections