Abstract
A six line recursive procedure is used to assess the efficiency of the procedure calling mechanism in ALGOL-like languages. The results from some 40 systems varying from ALGOL 68 and PL/I to System Implementation Languages for minicomputers are presented and compared. A hundred to one variation in performance occurs with this test, the major reasons for which are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Y. Sundblad,The Ackermann function. A theoretical, computational and formula manipulative study. BIT 11 (1971), 107–119.
Central Computer Agency,A comparison of computer speeds using mixes of instructions. Technical Support Unit, Note 3806, (1971).
B. A. Wichmann,ALGOL 60 Compilation and Assessment, Academic Press, London, (1973).
P. Z. Ingerman,Thunks — A way of compiling procedure statement with some comments on procedure declarations, Comm ACM. 4, (1961), 55–58.
B. J. Cornelius and G. H. Kirby,Depth of recursion and the Ackermann function, BIT 15 (1975), 144–150.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wichmann, B.A. Ackermann's function: A study in the efficiency of calling procedures. BIT 16, 103–110 (1976). https://doi.org/10.1007/BF01940783
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01940783