An Improved Proof of the Rabin-Harmanis-Stearns Conjecture

Author(s)
Perry, Harold M.
Thumbnail
DownloadMIT-LCS-TM-123.pdf (5.852Mb)
Metadata
Show full item record
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.
Date issued
1979-01
URI
https://hdl.handle.net/1721.1/148951
Series/Report no.
MIT-LCS-TM-123
Collections