DocumentCode :
2200833
Title :
On the efficiency of programs in subrecursive formalisms
Author :
Constable, Robert L. ; Borodin, Allan
fYear :
1970
fDate :
28-30 Oct. 1970
Firstpage :
60
Lastpage :
67
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.
Keywords :
Computational complexity; Computational efficiency; Computer aided instruction; Computer languages; Computer science; High level languages; Numerical models; Prototypes; Strontium; Writing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Switching and Automata Theory, 1970., IEEE Conference Record of 11th Annual Symposium on
Conference_Location :
USA
ISSN :
0272-4847
Type :
conf
DOI :
10.1109/SWAT.1970.16
Filename :
4569632
Link To Document :
بازگشت