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)
The complexity of loop programs
ACM '67 Proceedings of the 1967 22nd national conference
| Hi-index | 0.00 |
Restricted programming languages, for example primitive recursive definition schemes, are very often not nearly as succinct in describing primitive recursive functions as a general programming language [1]. We show that as one increases the power of programming languages, one can obtain economies in program size by any recursive amount for even very simple functions. This parallels a situation in the arithmetic hierarchy, where it is possible to get a recursively enumerable set whose smallest recursively enumerable index is much larger than the smallest index for the same set considered, say, as a set recursively enumerable in ø'. These phenomena follow from the fact that the ability to write programs which refer to the universal functions of an enumeration enables one to decrease significantly the size of programs. The notation, when not defined is that of [4].