4 ms·

Here's another nice big number link: http://www.scottaaronson.com/writings/bignumbers.html http://www.scottaaronson.com/writings/bignumbers.html If the invers

Here's another nice big number link: http://www.scottaaronson.com/writings/bignumbers.html http://www.scottaaronson.com/writings/bignumbers.html If the inverse of the Ackerman function grows more slowly than loglogloglog...log, and the inverse of BB(N) grows more slowly still, maybe that would be enough to conquer Knuth's arrow notation?

Laremere 12y ago
BB(N) must grow faster than any computable function. BB isn't computable because computing it would involve solving the halting problem. Any function which could grow larger than BB would imply solving the halting problem, and therefore can't be computable. Basically, inverse BB would eat Knuth's arrow notation for breakfast, and start asking about second breakfast and elevenses.