A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Speed-ups by changing the order in which sets are enumerated (Preliminary Version)
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
The complexity of loop programs
ACM '67 Proceedings of the 1967 22nd national conference
Computational Complexity and the Existence of Complexity Gaps
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Recursive Properties of Abstract Complexity Classes
Journal of the ACM (JACM)
Subrecursive Programming Languages, Part I: efficiency and program structure
Journal of the ACM (JACM)
Ordinal Hierarchies and Naming Complexity Classes
Journal of the ACM (JACM)
Classification of computable functions by primitive recursive classes
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Complexity classes of partial recursive functions (Preliminary Version)
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On the size of programs in subrecursive formalisms
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Unsolvability considerations in computational complexity
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Recursive properties of abstract complexity classes (Preliminary Version)
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
On minimal-program complexity measures
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
The intensional content of Rice's theorem
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Learning recursive functions: A survey
Theoretical Computer Science
The enumerability and invariance of complexity classes
Journal of Computer and System Sciences
Subrecursive programming languages II on program size
Journal of Computer and System Sciences
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Augmented loop languages and classes of computable functions
Journal of Computer and System Sciences
Complexity classes of partial recursive functions
Journal of Computer and System Sciences
Degrees of computational complexity
Journal of Computer and System Sciences
Effective operators with no strong gaps*
Journal of Computer and System Sciences
From logic to theoretical computer science: an update
Pillars of computer science
Hi-index | 0.00 |
The structure of the functions computable in time or space bounded by t is investigated for recursive functions t. The t-computable classes are shown to be closed under increasing recursively enumerable unions; as a corollary the primitive recursive functions are shown to equal the t-computable functions for a certain recursive t. Any countable partial order can be isomorphically embedded in the family of t-computable classes partially ordered by set inclusion. For any recursive t, there is a recursive t' which is (approximately) equal to an actual running time such that the t-computable functions equal the t'-computable functions.