On the efficiency of programs in subrecursive formalisms

  • Authors:

  • Robert L. Constable;Allan Borodin

  • Affiliations:

  • -;-

  • Venue:
  • SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
  • Year:
  • 1970

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.