r/googology • u/PM_ME_DNA • Nov 24 '24
Yo momma’s so fat
When she went to the bar and asked Graham his number, she wrote it down on her arm.
r/googology • u/PM_ME_DNA • Nov 24 '24
When she went to the bar and asked Graham his number, she wrote it down on her arm.
r/googology • u/No_View_7409 • Jul 02 '24
r/googology • u/ciphergoth • Feb 24 '20

Lambda calculus offers a clean way to precisely express a large number as a program, without needing to constantly invent new notation. Tromp diagrams give us a really nice way to look at lambda calculus programs and understand their structure. The above picture isn't gesturing at how to understand what Graham's number is - it is a complete specification of its exact value. My blog post goes into more detail; I've written software to generate diagrams like this, and have generated diagrams for several other numbers from 0 on to googleplex and Decker.
r/googology • u/gmalivuk • Dec 20 '25
Two commonly stated factoids about g_64 are that thinking of it would turn your brain into a black hole (presumably based on the Bekenstein bound for information within a brain-sized sphere) or that there aren't enough particles / Planck volumes / whatever in the observable universe to write down all the digits. But these both fall laughably short.
The information limit is only on the order of 1068 digits for a "brain-sized" (Schwarzschild radius of 10cm) black hole, there are about 1080 particles in the universe, and about 10186 Planck volumes (cubes a Planck length on each side). So 1010^186 is the largest number we could write out with one digit per Planck volume.
But 3↑↑4 has more than 3 trillion digits and 3↑↑5 has about 3↑↑4 digits.
3↑↑↑3 needs more than 7 trillion iterations of "the number of digits in" to get to something reasonable, and 3↑↑↑4 needs about 3↑↑↑3 iterations.
And then 3↑↑↑(3↑↑↑3) = 3↑↑↑↑3 = g_1 is the first step towards g_64.
So what I'm wondering is whether you've heard any somewhat accessible (to a layperson) facts about the size of g_64 that aren't so hilariously tiny.
r/googology • u/tsskyx • Nov 12 '24
r/googology • u/ProfessionalGeek • Jan 26 '25
r/googology • u/[deleted] • Nov 05 '19
So I made a function, call it f for simplicity's sake, which takes an ordered n-tuple of non-negative integers as an input. It's defined by the following (albeit convoluted) iteration:
f(n) := n+1
f(a_1, ... , a_n) := f[ (a_1) -1, b_2, b_3, ... , b_n ] +1
b_i := f(a_1, ... , (a_i) -1, ... , a_n) +1
if one of the terms in the n-tuple a_i = 0, remove the term (making the n-tuple into an (n-1)-tuple) and increment all following non-zero terms in the tuple by 1, then add 1 to the whole function, like this:
f(a_1, ... , a_(i-1), 0, a_(i+1), ... , a_n) := f(a_1, ... , a_(i-1), a_(i+1) +1, ... , a_n +1) +1
(This step is done simultaneously - if there are multiple zero terms, DO NOT increment terms that are also zero. ONLY increment non-zero terms)
f(0, 0, ... , 0) := 1
The definition in text form:
If the input n-tuple has length 1, output the input incremented by 1.
If the input n-tuple has length >1 but 1 or more of the terms in the tuple are 0, then for each individual 0 term do the following, before incrementing the whole function itself by 1:
Increment all non-zero terms to the right of this term by 1.
Remove this term from the tuple entirely.
If the input n-tuple has length >1 and all terms are non-zero, evaluate the function again using a new n-tuple, whose terms are defined by the following:
The 1st term is the same as before, but decremented by 1.
The i-th term (1 < i <= n) in the new input tuple is itself an evaluation of f on the original tuple, with the i-th term in the original tuple decremented by 1, then this whole term is incremented by 1.
Increment this whole new function evalution by 1.
So, now that we've got the definition out of the way, we can look at the smallest possible case, where we only feed the function tuples of the form (1, 1, ... , 1):
f(1) = 1+1 = 2
f(1, 1) = f[ 0, f(1, 0) +1 ] +1 = f[ f(1,0) +2 ] +2 = f[ f(1) +3 ] +2 = 8
f(1, 1, 1) = f[ 0, f(1, 0, 1) +1, f(1, 1, 0) +1 ] +1 = ... = f(16, 11) = don't even bother trying to calculate this
The value of f(1, 1, 1) is something which I believe involves the number 5, and the operation ^16 (up-arrows, "octadecation"?), which is stupidly large. I wonder how this function grows, anyone wanna help me analyse this? It feels like it might have some interesting properties.
Things I Worked Out:
f(1, n) = 5n +3
f(2, n) = 6*(5n) -1
f(3, n) = [involves tetration]
f(n, 1) = f(n-1, n+3) +1
f(n, 2) = [involves exponentiation to the degree ~f(3, k_3) where k_3 is of the order ~f(4, k_4) ... to k_(n-1)]
EDIT 1: corrected errors in my workings - results should now be correct / more accurate.
EDIT 2: rewrote the general definition formula at the top to be a little clearer by adding another line of formulae.
EDIT 3: fixed f(2,n) (again)
r/googology • u/KingSupernova • Aug 20 '25
Normally when composing increasing functions, applying the fastest-growing one last will lead to the highest asymptotic growth rate, since it's more efficient to save the largest input for the most powerful function. But this is not true here; factorial is superexponential, and yet somehow the exponent dominates. Why?
r/googology • u/UserNosaj • Dec 28 '24
Insane crazy math that generates the most insanely large and ungraspable numbers ever, and insanely complex proofs and papers.
Random dudes asking dumb questions about is GGG64 larger than TREE(3).
r/googology • u/yjain2003 • Mar 31 '24
I'd argue that it's very likely, and that the Graham's number appears more than a Graham's number amount of times in TREE(3).
Thoughts?
Some back of the hand calculations. There are ~TREE(3) sequences of digits to check. The probability of each "sequence" containing G64 is (1/10)^(G64), assuming the digits in TREE(3) are random (big assumption).
Then, the probability of at least 1 sequence being G64 is 1 - (1 - (1/10)^(G64))^(TREE(3)) ≈ 1 - 0 = 1
r/googology • u/yeeyee2461 • Jul 08 '20
I'm kind of confused on how Bigfoots larger than Rayo's number. There's infinte ways to make a function more efficent and we can't write a googol amount of symbols so how could Bigfoot possibly be bigger? I've done some research but I can't find much information about the number. Also, try to explain it as simplistic as possible. I'm 14, know only three functions (Graham"s number, TREE(3) and Rayo's number. I also know about googol and googolplex but those aren't functions) and have very little understanding of set theroy. Furthermore, i've only been learning about googology for a few weeks.
r/googology • u/OPsTheLopper • Jul 16 '23
1099 is 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 and 1 duotrigintillion. It is 100 decimal digits in length. It's cousin, 10 duotrigintillion, gets a lot of mentions but this number not so much. This number is aesthetically pleasing to me, so I took about one minute out of my life to appreciate it and think about it.
r/googology • u/GigaTune • Jun 28 '21
Is it true that there is not enough space in the observable universe to write out Graham's number even using scientific notation?
r/googology • u/Letholdrus • Dec 14 '25
Given we know how Graham's Number is constructed, how can we know that TREE(3) is so much larger?
r/googology • u/blueTed276 • Apr 27 '25
A high effort video I guess. There may be some mistakes because the editing software is sooo laggy.
r/googology • u/holomanga • Apr 01 '22
A thread in which to play my number is bigger! Because this is reddit, threads can branch, which makes it more interesting than everyone instantly naming the biggest Rayolike they can think of and then leaving. Standard rules apply, must be integers and nontrivial given the previous number etc.