The iterated logarithm \(\log^* x\) is defined as the number of iterations of \(\log x\) needed to reach a number less than 1. It is used in computational complexity theory; there are algorithms known to have time complexity \(O(\log^* n)\). \(\log^*\) 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.