Journal of the ACM Bibliography
Robert L. Constable and Allan B. Borodin.
Subrecursive programming languages, part I: Efficiency and program
structure. Journal of the ACM, 19(3):526-568, July 1972.
[BibTeX entry]
Additional Key Words and Phrases:
programming language, universal machine, computational complexity,
complexity class, subrecursive hierarchy, program size, primitive
recursive functions, elementary functions, Loop language, Grzegorczyk
hierarchy, speed-up theorem
Selected references
- Manuel Blum. A
machine-independent theory of the complexity of recursive functions.
Journal of the ACM, 14(2):322-336, April 1967.
- Manuel Blum. On
effective procedures for speeding up algorithms. In Conference
Record of ACM Symposium on Theory of Computing, pages 43-53,
Marina del Rey, California, 5-7 May 1969.
- Manuel Blum. On the size of
machines. Information and Control, 11(3):257-265,
September 1967.
- A. Borodin. Complexity classes of
recursive functions and the existence of complexity gaps. In
Conference Record of ACM Symposium on Theory of Computing,
pages 67-78, Marina del Rey, California, 5-7 May 1969.
- Robert L. Constable. On the size of programs in
subrecursive formalisms. In Conference Record of Second Annual
ACM Symposium on Theory of Computing, pages 1-9, Northampton,
Massachusetts, 4-6 May 1970.
- Calvin C. Elgot and Abraham Robinson. Random-access stored-program
machines, an approach to programming languages. Journal of the
ACM, 11(4):365-399, October 1964.
- J. Hartmanis and J. E. Hopcroft. An overview of the theory of
computational complexity. Journal of the ACM,
18(3):444-475, July 1971.
- E. M. McCreight and A. R. Meyer. Classes of computable
functions defined by bounds on computation: Preliminary report. In
Conference Record of ACM Symposium on Theory of Computing,
pages 79-88, Marina del Rey, California, 5-7 May 1969.
- Albert Meyer and Patrick C. Fischer. On computational
speed-up. In Conference Record of 1968 Ninth Annual Symposium
on Switching and Automata Theory, pages 351-355, Schenectady, New
York, 15-18 October 1968. IEEE.
- J. C. Shepherdson and H. E. Sturgis. Computability of recursive
functions. Journal of the ACM, 10(2):217-255, April
1963.
Shortcuts: