1.Previous
3.Next

Other studies might define an inverse function of one where m is set to a constant, such that the inverse applies to a particular row.

The inverse of the Ackermann function is primitive recursive, since it is graph primitive recursive, and it is upper bounded by a primitive recursive function.

Usage

In computational complexity

The Ackermann function appears in the time complexity of some algorithms, such as vector addition systems

1.Previous
3.Next