Depth of recursion and the ackermann function

  title={Depth of recursion and the ackermann function},
  author={Barry Cornelius and G. H. Kirby},
  journal={BIT Numerical Mathematics},
The maximum depth of recursion refers to the number of levels of activation of a procedure which exist during the deepest call of the procedure. A re-examination of the maximum depth of recursion of the Ackermann function results in a new formula which takes a full account of the dependence of this property on the parameters. It is shown that the recursive use parameter of the Ackermann function contributes to the depth of recursion, and that this contribution may be reduced by rearranging the… 
A programming technique for recursive procedures
A programming technique is described for ALGOL-like recursive procedures in which parameters and local variables are replaced by variables global to the recursive procedure and declared in a
Ackermann's function: A study in the efficiency of calling procedures
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
A heap‐based implementation of the programming language Pascal
  • C. Marlin
  • Computer Science
    Softw. Pract. Exp.
  • 1979
The implementation of Pascal known as Pascal ‘P’ was modified so that activation records for blocks (procedures and functions) were no longer allocated on a stack, but were instead allocation on a heap, to assess the efficiency of implementing Pascal procedures and functions in this way.
Highway Reliability Management Model Based on Depth Recursion for Transportation Demand
An effective estimation method for the highway reliability management according to the Zhukov usage model based on the recursive test is put forward. This method makes use of the important sampling
Programming language ALGOL 68
The basic concepts of ALGOL 68 are presented. The prospects for its use and mathematical questions related to its implementation are discussed.


The Ackermann function. a theoretical, computational, and formula manipulative study
A SYMBAL formula manipulating program, that automatically solves recurrence relations for the first members of the function class and for the number of calls needed in their straightforward computation, is given.
Problem-solving methods in artificial intelligence
  • N. Nilsson
  • Education
    McGraw-Hill computer science series
  • 1971
This paper will concern you to try reading problem solving methods in artificial intelligence as one of the reading material to finish quickly.
Zum Hilbertschen Aufbau der reellen Zahlen
Um den Beweis fiir die yon Cantor aufgestellte Vermutung zu e~bringen, dal~ sich die Menge der ree|len Zahlen, d. h. der zaMentheoretischen I~unktionen, mi~ Hilfe der Zahlen de~ zweiten Zahlklasse
Introduction to Computer Science