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

Complexity Classes of Recursive Functions

Thumbnail Image
Download
Name

MIT-LCS-TR-110.pdf

Size

2.77 MB

Format

Adobe PDF

Checksum (MD5)

69d18bbafccce1f8ac5fcf3adf385b71

Author(s)
Moll, Robert
Advisor(s)
Meyer, Albert R.
Date Issued
June 1973
Series/Report no.
MIT-LCS-TR-110
MAC-TR-110
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'.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.