3 ms·
Graham's Number? http://en.wikipedia.org/wiki/Graham%27s_number http://en.wikipedia.org/wiki/Graham%27s_number
by arethuza 16y ago
Graham's Number?
http://en.wikipedia.org/wiki/Graham%27s_number http://en.wikipedia.org/wiki/Graham%27s_number
- baddox 16y agoLet g = Graham's number. Then use Knuth's up arrow notation. Then (and this is perhaps cheating) use a non-computable function like the busy beaver function, which grows faster than ANY computable function. That last step may in fact not be cheating, because it might be possible to prove a lower bound and therefore prove that it's higher than the opponent's number. Pretty notation here: http://mathbin.net/50035 http://mathbin.net/50035
- jmatt 16y agoThis is what I was thinking. Knuth's up arrow on Graham's number. I like the addition of the busy beaver function. A creative improvement for sure. So far I think you win :) for the lazy amongst us: http://en.wikipedia.org/wiki/Knuths_up-arrow_notation http://en.wikipedia.org/wiki/Knuths_up-arrow_notation
- Timothee 16y agoIf you use Busy Beavers, shouldn't you go all out and do something like that: BB(BB(BB(BB(BB(…g↑↑↑↑g))))) or a mix thereof? edit: I'd actually try BB(BB(BB(BB(BB(…g↑↑↑↑g)))))+1, just in case.
- baddox 16y agoThere's no end to that. You could define a function BZ(n) that equals BB(BB(BB...(g↑↑↑...g)...)) with n nested BB's and n up arrows. Then you could define a function RBB(n) that equals BZ(BZ(BZ...(g↑↑↑...g)...)) with n nested BZ's and n up arrows.
- joe_the_user 16y agoIf the busy beaver function runs on a computer, it is computable, unless I missed something pretty interesting.
- prodigal_erik 16y agoA busy beaver is a Turing machine that runs for more steps than any other machine (having the same state machine size) but eventually halts (rather than looping forever). The busy beaver function measures the run times of all busy beavers, the maximum number of steps you can get out of each state machine size. Apparently Radó proved this value eventually grows larger than any computable function. http://en.wikipedia.org/wiki/Busy_beaver#Non-computability_of_.CE.A3 http://en.wikipedia.org/wiki/Busy_beaver#Non-computability_o...
- baddox 16y agoThe busy beaver function doesn't run on a computer. We only know Σ(n) for n < 5. I think you are missing out on something extremely interesting—that there are limits on what computers can compute, even given unbounded resources and time.
- robinhouston 16y agoAaronson is talking about Graham‘s number when he writes: “Recondite as it seems, the Ackermann sequence does have some applications. A problem in an area called Ramsey theory asks for the minimum dimension of a hypercube satisfying a certain property. The true dimension is thought to be 6, but the lowest dimension anyone’s been able is prove is so huge that it can only be expressed using the same ‘weird arithmetic’ that underlies the Ackermann sequence. Indeed, the Guinness Book of World Records once listed this dimension as the biggest number ever used in a mathematical proof.” That‘s about a third of the way through the article. The numbers get a lot bigger after that. As a footnote, the true dimension is no longer thought to be six — Aaronson’s essay was written in 1999 — and is now known to be at least 11. The Wikipedia article linked above has a reference for this improved lower bound.
- arethuza 16y agoYeah, it was probably the Guinness Book of World Records where I picked up the reference to Graham's Number.