The honest subrecursive classes are a lattice

Theory of Recursive Functions and Effective Computability.

Solomon Feferman, Hartley Rogers · American Mathematical Monthly · 1969 · 2.8K citations

Computing, Computer Science, Mathematics +14

Theory of Recursive Functions and Effective Computability

D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text

Computing, Computer Science, Mathematics +14

Computability and Unsolvability.

Calvin C. Elgot, Martin Davis · Mathematical Tables and Other Aids to Computation · 1959 · 1K citations

Formal Languages and their Relation to Automata

James B. Morris · Nuclear Science and Engineering · 1970 · 1K citations

Computing, Computer Engineering, Computer Science +12

A Machine-Independent Theory of the Complexity of Recursive Functions

Manuel Blum · Journal of the ACM · 1967 · 835 citations · Full text

Computing, Computer Science, Algorithms +11