The Ackermann function or Ackermann-Péter function is defined recursively for non-negative integers m and n as follows:
In the theory of computation, the Ackermann function is a simple example of a recursive function that is not primitively recursive. Note that this function grows very quickly -- even
A(4, 3) cannot be feasibly computed on ordinary computers.
Pages in category "Ackermann function"
The following 5 pages are in this category, out of 5 total.