> There are some such algorithms. You don't encounter them as often because we are biased towards encountering algorithms that can be implemented efficiently
Oh, but inverse Ackerman is very slow, and exp(a^(-1)(n)) is very slow as well. Same with the iterated logarithm.
The later pops up in recursive algorithms that partition in parts of size log n. I don't think that's a very weird thing to do.
Oh, but inverse Ackerman is very slow, and exp(a^(-1)(n)) is very slow as well. Same with the iterated logarithm.
The later pops up in recursive algorithms that partition in parts of size log n. I don't think that's a very weird thing to do.