Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
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
Classes of computable functions defined by bounds on computation: Preliminary Report
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Hierarchies based on computational complexity and irregularities of classdetermining measured sets
Hierarchies based on computational complexity and irregularities of classdetermining measured sets
Properties of complexity classes and sets in abstract computational complexity
Properties of complexity classes and sets in abstract computational complexity
Recursive Properties of Abstract Complexity Classes
Journal of the ACM (JACM)
On Almost Everywhere Complex Recursive Functions
Journal of the ACM (JACM)
Hi-index | 0.00 |
This paper studies possible extensions of the concept of complexity class of recursive functions to partial recursive functions. Many of the well-known results for total complexity classes are shown to have corresponding, though not exactly identical, statements for partial classes. In particular, with two important exceptions, all results on the presentation and decision problems of membership for the two most reasonable definitions of partial classes are the same as for total classes. The exceptions concern presentations of the complements and maximum difficulty for decision problems of the more restricted form of partial classes. The last section of this paper shows that it is not possible to have an “Intersection Theorem”, corresponding to the Union Theorem of McCreight and Meyer, either for complexity classes or complexity index sets.