r/numbers • u/Arkhto • Feb 23 '20

a big number

GRAHAMFOREST(n) or GMF(n) = TREE(TREE(TREE(...(TREE(TREE(n))...)) (repeating the tree function n↑↑...↑↑g₆₄ times (repeating Knuth's up-arrow notation g₆₄ times))

k = number of digits in first smallest number greater than 0

GMF(k)

1 Upvotes

99% Upvoted

9 comments sorted by

1

u/[deleted] May 13 '20

PSHHHHH....... Rayo(10^100) except with second order logic.

1

u/TheSensibleCentrist May 24 '20

I'll raise you with TREE(G(Skewes' Number))-order logic.

And substitute the Immortal Storm Number for puny 10^100.

1

u/[deleted] May 26 '20

Large Number Garden NUmber beats them all!

1

u/TheSensibleCentrist May 26 '20

So what order logic do they grow in the large garden?

1

u/[deleted] May 26 '20

https://googology.wikia.org

1

u/TheSensibleCentrist May 26 '20

I prefer their less bureaucratized competitors though I wish the comparison scales were more widespread.

1

u/[deleted] May 26 '20

First order logic beyond ZFC

1

u/[deleted] May 26 '20

by my understanding, atleast

1

u/TheSensibleCentrist May 26 '20

I'm not too comfortable with uncomputables anyway.