# Can one find an algorithm whose running time is larger than Ackermann's function?

Is there an example of an algorithm whose time complexity is strictly larger than Ackermann's function?

## 1 Answer

$$A(n,n)$$ is computable. So a trivial algorithm with complexity $$O(A(n,n)^2)$$ is the following:

1. Compute $$x = A(n,n)$$.
2. Loop $$x^2$$ times, doing nothing.
• A(n+1, n+1) has a hugely higher time complexity. – gnasher729 Nov 25 '20 at 14:01