ackermann_cli

Programs to evaluate Ackermann’s function.

Note

The version of the Ackermann’s function being used is defined recursively by

  • ackermann(0,n) = n+1                                 for n >= 0

  • ackermann(m,0) = ackermann(m-1,1)                    for m >= 0

  • ackermann(m,n) = ackermann(m-1, ackermann(m, n-1))   for m,n > 0

Ackermann’s function is an example of a computable but not primitively recursive function.

  • ackermann_list: Computes Ackermann’s function by simulating recursion with a list.

boring_math.recursive_functions.cli.ackermann_cli.ackermann_list_cli() → None

Evaluate Ackermann’s function simulating recursion with a Python list.

Usage: ackermann_list m n

Becomes numerically intractable after m=4 n=1.