Work

Complexity Classes of Recursive Functions

Year: 1973
Type: article
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'.
Author: Moll, Robert
Language: English
Open Access status: green
OpenAlex ID: W217287925
FWCI: 1.748
Cites: 56
Cited by: 6
Related to: 10