Can one find an algorithm whose running time is larger than Ackermann's function?
$A(n,n)$ is computable. So a trivial algorithm with complexity $O(A(n,n)^2)$ is the following:

Compute $x = A(n,n)$.
Loop $x^2$ times, doing nothing.