Digression: Doping at the Silicon Downs
How fast does log n grow? log n = 4 for n = 16
Let log(k) n = log (log (log … (log n)))
Then, let log* n = minimum k such that log(k) n ? 1
How fast does log* n grow? log* n = 4 for n = 65536
Ackermann created a really big function A(x, y) with the inverse ?(x, y) which is really small
How fast does ?(x, y) grow? ?(x, y) = 4 for n far larger than the number of atoms in the universe (2300)