Ackermann function

Computes the Ackermann function

Ackermann function or Ackermann-Peter function is a simple example of a recursive function that is not primitive recursive. It takes two natural numbers as arguments and yields a natural number, and its value grows extremely quickly.

The simplest example of a well-defined total function which is computable but not primitive recursive

An Ackermann calculator with customizable stack memory allocation

A collection of short programs of interesting things

Calculate the the value of ackermann(n, m) for arbitrarily large integers

Ackermann benchmark with GitHub Actions.

Application calculates value of Ackermann function using AsyncTask.

The Ackermann function is a classic example of a recursive function, notable especially because it is not a primitive recursive function. It grows very quickly in value, as does the size of its call tree.

Computer Architectures projects (Fibonacci, Simple Calculator, Ackermann Function) implemented in ARMv8 assembly language.

This is a program that will try to illustrate how the Ackermann function operates using ncurses

Ackermann function with big numbers support