An Improved Proof of the Rabin-Harmanis-Stearns Conjecture
| dc.contributor.author | Perry, Harold M. | en_US |
| dc.date.accessioned | 2023-03-29T14:12:17Z | |
| dc.date.available | 2023-03-29T14:12:17Z | |
| dc.date.issued | 1979-01 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148951 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-123 | |
| dc.title | An Improved Proof of the Rabin-Harmanis-Stearns Conjecture | en_US |
| dc.identifier.oclc | 4637436 |
