The enumerability and invariance of complexity classes

Authors:
F. D. Lewis
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1971

Citing 8
Cited 0

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)
On the size of programs in subrecursive formalisms

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
On computational speed-up

SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
Dense and non-dense families of complexity classes

SWAT '69 Proceedings of the 10th Annual Symposium on Switching and Automata Theory (swat 1969)
The operator gap

SWAT '69 Proceedings of the 10th Annual Symposium on Switching and Automata Theory (swat 1969)
Hierarchies of memory limited computations

FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several properties of complexity classes and sets associated with them are studied. An open problem, the enumerability of complexity classes, is settled by exhibition of a measure with some nonenumerable classes. Classes for natural measures are found to occupy the same isomorphism type; and a criterion for measures comes from this finding. General results about measures and unsolvability are presented and constraints are placed on complexity classes so that they possess identical properties.