We are experiencing minor difficulties with some of our submission forms, which we are working to resolve. You should still be able to submit items, but if you have any issues while submitting, please contact us at dspace-lib@mit.edu.

An Improved Proof of the Rabin-Harmanis-Stearns Conjecture

Thumbnail Image
Download
Name

MIT-LCS-TM-123.pdf

Size

5.85 MB

Format

Adobe PDF

Checksum (MD5)

0062bb43cff918cc7873880ff0d603b2

Author(s)
Perry, Harold M.
Date Issued
January 1979
Series/Report no.
MIT-LCS-TM-123
Abstract
We offer an improved presentation of Aanderaa's constructive proof of the Rabin-Hartmanis-Stearns conjecture: For all k≥2, there exists a language Lk such that Lk can be recoginzed by a k-worktape real time Turing machine but cannot be recognized by any (k-1)-worktape real time Turing machine.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.