Its most well known form was developed by Rozsa Peter and Raphael Robinson and is known as the two-variable version.
This function provides the theoretical justification of "zeration" and it also demonstrates the existence of an infinite series of hyperoperations through its recurrence relation. Any sequence of m union-find operations on a set of size n takes m times alpha of n time, where alpha is the inverse of this function. This function is the diagonalization of the Grzegorczyk (zuh-gor-cich) hierarchy and is the most famous function that cannot be implemented using only do loops. Its most well known form was developed by Rozsa Peter and Raphael Robinson and is known as the two-variable version. For 10 points, name this simplest example of a well-defined total function that is Turing computable but not primitive recursive, often shown as A of m comma n.
This function provides the theoretical justification of "zeration" and it also demonstrates the existence of an infinite series of hyperoperations through its recurrence relation.
{Ackermann} function