Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Computability of Recursive Functions
Journal of the ACM (JACM)
Random-Access Stored-Program Machines, an Approach to Programming Languages
Journal of the ACM (JACM)
A Machine-Independent Theory of the Complexity of Recursive Functions
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
The complexity of loop programs
ACM '67 Proceedings of the 1967 22nd national conference
Subrecursive Programming Languages, Part I: efficiency and program structure
Journal of the ACM (JACM)
Classification of computable functions by primitive recursive classes
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The enumerability and invariance of complexity classes
Journal of Computer and System Sciences
Augmented loop languages and classes of computable functions
Journal of Computer and System Sciences
| Hi-index | 0.00 |
This paper gives an overview of subrecursive hierarchy theory as it relates to computational complexity and applies some of the concepts to questions about the size of programs in subrecursive programming languages. The purpose is three-fold, to reveal in simple terms the workings of subrecursive hierarchies, to indicate new results in the area, and to point out ways that the fundamental ideas in hierarchy theory can lead to interesting questions about programming languages. A specific application yields new information about Blum's results on the size of programs and about the relationship between size and efficiency.