On the efficiency of programs in subrecursive formalisms
Robert L. Constable, Allan Borodin · 1970
We study the effect of program structure on computational efficiency in a class of abstract languages which model actual high-level numerical programming languages (like ALGOL). The results have bearing on programming technique (the use of go to statements), and they yield interesting facts about Blum's speed-up theorem for subrecursive computational complexity.