| dc.contributor.advisor | Meyer, Albert R. | en_US |
| dc.contributor.author | Moll, Robert | en_US |
| dc.date.accessioned | 2023-03-29T14:57:18Z | |
| dc.date.available | 2023-03-29T14:57:18Z | |
| dc.date.issued | 1973-06 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149418 | |
| dc.description.abstract | An honest function is one whose size honestly reflects its computation time. In 1969 Meyer and McCreight proved the "honesty theorem," which says that for every t, the t-computable functions are the same as the t'computable functions for some honest honest t'. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-110 | |
| dc.relation.ispartofseries | MAC-TR-110 | |
| dc.title | Complexity Classes of Recursive Functions | en_US |
| dc.identifier.oclc | 02338047 | |
