Recursive properties of abstract complexity classes (Preliminary Version)

Authors:
L. H. Landweber;E. L. Robertson
Affiliations:
University of Wisconsin, Madison, Wisconsin;University of Wisconsin, Madison, Wisconsin
Venue:
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Year:
1970

Citing 4
Cited 5

A Machine-Independent Theory of the Complexity of Recursive Functions

Journal of the ACM (JACM)
Toward a Theory of Enumerations

Journal of the ACM (JACM)
Unsolvability considerations in computational complexity

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

Computational Complexity and the Existence of Complexity Gaps

Journal of the ACM (JACM)
Complexity classes of partial recursive functions (Preliminary Version)

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Hierarchies based on computational complexity and irregularities of class determining measured sets (Preliminary Report)

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Subrecursive programming languages II on program size

Journal of Computer and System Sciences
Abstract computational complexity and cycling computations

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is proven that complexity classes of abstract measures of complexity need not be recursively enumerable. However, the complement of each class is r.e. Properties of effective enumerations of complexity classes are studied. For any measure there is another measure with 'almost' the same complexity classes such that almost every class admits an effective enumeration in terms of speedy devices. Finally complexity classes are shown to not be closed under intersection.