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

A Space Bound for One-tape Multidimensional Turing Machines

Thumbnail Image
Download
Name

MIT-LCS-TM-145.pdf

Size

2.71 MB

Format

Adobe PDF

Checksum (MD5)

0e3d7ff4f11619dd45f06c018118b3c3

Author(s)
Loui, Michael C.
Date Issued
November 1979
Series/Report no.
MIT-LCS-TM-145
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.