A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Recursive Properties of Abstract Complexity Classes
Journal of the ACM (JACM)
Classes of computable functions defined by bounds on computation: Preliminary Report
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Dense and non-dense families of complexity classes
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)
On the structure of subrecursive degrees
Journal of Computer and System Sciences
Augmented loop languages and classes of computable functions
Journal of Computer and System Sciences
Degrees of computational complexity
Journal of Computer and System Sciences
| Hi-index | 0.00 |
A function is said to be computationally reducible to another if it requires less space(or a smaller amount of some other resource) to compute. When the recursive functions are ordered according to this reducibility several interesting facts emerge. The classes formed with functions that have ''best algorithms'' correspond to the complexity classes named by tape-complexity functions. In addition, several results concerning the structure of complexity classes and density are presented.