Computability of Recursive Functions
Journal of the ACM (JACM)
Random-Access Stored-Program Machines, an Approach to Programming Languages
Journal of the ACM (JACM)
On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Recursive properties of abstract complexity classes (Preliminary Version)
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
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
The complexity of loop programs
ACM '67 Proceedings of the 1967 22nd national conference
SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
On the efficiency of programs in subrecursive formalisms
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Some definitional suggestions for automata theory
Journal of Computer and System Sciences
Hi-index | 0.00 |
Programming languages which express programs for all computable (recursive) functions are called universal, those expressing programs only for a subset are called subrecursive programming languages, SPL's. M. Blum has shown that for certain SPL's any universal programming language (UPL) contains programs which are arbitrarily shorter and nearly as efficient as the shortest SPL program for the same function. We offer new proofs of this theorem to make the relationship beteeen size and efficiency more revealing and to show that finitely often efficiency is the price of economy of size. From the new proof we derive refinements of the basic theorem. In particular, we consider the size-efficency exchange for the task of computing constants, and derive a measure of the relative expressive power of SPL's. The results are illustrated with some new programming language models.