Module `grscheller.boring_math.cli.ackermann`

Entry points for CLI scripts to evaluate Ackermann's function.

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

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

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

Functions

def ackermann_list_cli() ‑> None

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

Usage: ackerman_list m n