The inverse Ackermann function \(\alpha(N)\) is defined as the least \(n\) such that \(A(n) \geq N\) (the single argument Ackermann function). It is notable on its own for its use in computational complexity theory; there are algorithms known to have time complexity \(O(\alpha(n))\) (or otherwise involving the function). \(\alpha\) is so slow-growing that such algorithms practically run in constant time.

Ad blocker interference detected!

Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.