On classes of computable functions

Authors:
Sanat K. Basu
Affiliations:
Carnegie-Mellon University, Department of Computer Science, Pittsburgh, Pennsylvania
Venue:
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Year:
1969

Citing 2
Cited 3

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)

Polynomial and abstract subrecursive classes

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

Journal of Computer and System Sciences
On the structure of subrecursive degrees

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The complexity closure of a computable function is defined by a set of axioms. The axioms are satisfied by complexity classes that are computation time closed and also by other complexity classes which do not have this property. It is then shown that there exist honest recursive functions whose complexity closure are setwise incomparable. Further that there exist chains of honest recursive functions whose complexity closures are densely ordered under set inclusion.