Supporting #TeamTrees on a quest to plant 20 million trees - www.teamtrees.org/ Original brown papers from this video available to support the campaign - bit.ly/brownpapers
Can you please show me a spread sheet with the heights that the tree has had Not just exactly 1 year after you planted it and exactly 2 years after you planted it but also provide values between 0 years after you planted it and 1 year after you planted it and values between 1 year after you planted it and 2 years after you planted and all the way to now. Ps it should not be too hard to figure out the heights for whole numbers like 0,1,2,3,4... even if some of them you have to use a weird mathematical function to show the answer (Like even weirder than power towers.).
I thought of it like this. The tree function gives much larger values than the g function. So at the enormous scales that we're talking about, all that matters is what is inside the tree function. So tree(g64) is better than g(tree(64)) because you're giving a bigger number to tree. It doesn't even matter what g is doing at this point.
So sure, Tree(Graham’s Number) is big. But I have just been exploring the harmonic series (1 + 1/2 + 1/3 + 1/4 + 1/5 …). It is divergent. It takes around 10^43 terms just to get it to sum to a hundred, and it gets way way slower after that. So my number (‘Geoff’s Number’ if no one has claimed this before) is: “The number of terms required for the harmonic series to sum to Tree (Graham’s Number)”.
@@GeoffBeggswell 1+1/2+1/3+...+1/n approximately ln(n)+euler m constant and the approximation gets better and better the larger the n. Because tree(g(64)) is so massive, e^(tree(g(64)-euler m constant) number of term is super sccurate approximation
@@GeoffBeggs yes, it is the same size as TREE(Graham’s number). When you are dealing with numbers this big, raising them to a power doesn’t make much difference.
If you look at it through the levels of googology: level 0 is all the single digit and small numbers tending to zero; then level 1 goes from double-digits to a million; then level 2 goes beyond this all the way to a million digits (yes, googol and virtually every number we can practically deal with in our observable universe doesn't even get past level 2); level 3 starts entering the realms of tetration with googolplex and the likes; level 4 goes well beyond googolplexian and so on. You can see how going up just one level in the realms of googology gets to even greater magnitudes much further away than the levels before it. Well, G1 sits around level 6 or 7 and then G64 is much further at level 12, with fw(n) starting here or the level before it (11) let that sink in. So you can see that the difference between 12 levels is the difference between mere counting and shooting past G64 by iterating the number of arrows. Now you run through all the ordinals from omega through epsilon, zeta, eta until you reach the insane gamma-zero; the latter is all the way up to level 100 in the fast-growing hierarchy, meaning that counting to even G(G(...G(64))) [G64 iterations] would be much faster than using the G(n) function (or even f-epsilon0 for that matter) to reach the monsters produced by fgamma-zero(n). However, even then TREE(3) would laugh at this, as it's all the way up in level 120. That's right, an entire 20 levels ahead of fgamma-zero(n), which is insanely further apart than 0-1 and G64 which is merely 12 levels. This means even using fgamma-zero(n) to reach TREE(3) would be much slower (which is still an understatement) than merely counting to G64, even if you were to count in base 1/G64.
@@fernandourquiza4593 the book is utterly mind blowing. I am half through (last chapter "Graham's Number, current chapter TREE (3)). The book is more than about math - he gets into a lot of physics, the concept of how big would the universe have to be before you would find an exact double of yourself, is the universe that big? Ect.
I'm not mathematically smart.......but i due enjoy learning about big numbers and I mean BIG numbers like the ones larger than the ones in this video. Like Fish number, etc
It's crazy that such a simple "game" to explain, like TREE(n), which you may easily explain to even a first grader, is so insanely more powerful than even Γ₀, which requires pretty advanced mathematics to even begin conceptualizing. Mathematics is beautiful!
TREE(n) lies between the SVO and LVO in fast growing hierarchy. The SVO is lower bound and LVO the upper bound. It is much closer to the SVO but slightly faster than that
The SVO and LVO is just ridiculous just to let you know. If you want i can link a video to explain these ordinals. Then you will understand why Tony said in the video that anything beyond gamma gets messy😂😂
@@R3cce If you look at it through the levels of googology: level 0 is all the single digit and small numbers tending to zero; then level 1 goes from double-digits to a million; then level 2 goes beyond this all the way to a million digits (yes, googol and virtually every number we can practically deal with in our observable universe doesn't even get past level 2); level 3 starts entering the realms of tetration with googolplex and the likes; level 4 goes well beyond googolplexian and so on. You can see how going up just one level in the realms of googology gets to even greater magnitudes much further away than the levels before it. Well, G1 sits around level 6 or 7 and then G64 is much further at level 12, with fw(n) starting here or the level before it (11) let that sink in. So you can see that the difference between 12 levels is the difference between mere counting and shooting past G64 by iterating the number of arrows. Now you run through all the ordinals from omega through epsilon, zeta, eta until you reach the insane gamma-zero; the latter is all the way up to level 100 in the fast-growing hierarchy, meaning that counting to even G(G(...G(64))) [G64 iterations] would be much faster than using the G(n) function (or even f-epsilon0 for that matter) to reach the monsters produced by fgamma-zero(n). However, even then TREE(3) would laugh at this, as it's all the way up in level 120. That's right, an entire 20 levels ahead of fgamma-zero(n), which is insanely further apart than 0-1 and G64 which is merely 12 levels. This means even using fgamma-zero(n) to reach TREE(3) would be much slower (which is still an understatement) than merely counting to G64, even if you were to count in base 1/G64.
"This next guy, I'm not going to write it out, because it has 121 million digits." This has to be in the top ten Numberphile videos of all time. Maybe top three even?
Yeah, but what if each of your brain cells contained as many brains, as your brain has brain cells? No, wait, what if each of your brain cells contained as many brains, as the number of possible permutations on the set of all brain cells in all of the brains in all universes real and imaginary? No, wait, what if all brains were like that, and then what if each of your brain cells could produce that many new brains per nanosecond, for each possible permutation on the set of all of the brain cells in all of those brains?
If I had a TREE(g(Γ₀!))-brain for every 1/(TREE(g(Γ₀!))) Planck Volume within the known universe (let's just call that a Ж-brain), and then had Ж Ж-brains for every one of those, I would probably die.
@@jonadabtheunsightly Even if each of those brains had the combined capacity of the greatest scientists in the history of humanity, you still wouldn't come close to comprehending these numbers
Fascinating that g and TREE are so fast growing that you need transfinite ordinals to put them in a hierarchy. This is probably the best way to convey their power.
I'm at just over 14 minutes and am going to have to rest my mind and finish this tomorrow. Have just watched the 2 videos on tree(3) beforehand. This feels like staring into the abyss and it's rather terrifying, and as well, my mind feels like it's melting down from struggling to comprehend such enormity. Who knew that maths could get kind of terrifying?!
It's amazing that even without the ordinal Mathematics, we can still tell that TREE function grows (way) more quickly than Graham's function. TREE(n) literally goes from 1 to 3 to something that is way way way way way bigger than Graham's number, while G(n) needs 64 layers to go from 3^^^^3 to Graham's number. It's absolutely safe to say that at least the numbers G(1) to G(64) are all within the gap between 3 and TREE(3). The jumping between G(n) is essentially stationary compared to that between TREE(n).
@@PC_SimoTREE(n) grows at a rate between the SVO and LVO in fast growing hierarchy. These ordinals are beyond gamma. I can link a video to explain these ordinals if you want. You will then understand why Tony said in this video that anything beyond gamma gets messy😂
Things can start slowly then get really big later though. Tree is still a computable function. The Busy Beaver function has pretty reasonable values for small values, but it grows much faster than any computable function.
@R3cce It more than likely isn’t anywhere close. SVO just covers a lot of area within ordinal collapsing functions so it more than likely grows faster than TREE(n), it’s just nobody really knows so they slap it on SVO because it’s the best estimate. The only thing we do know is it is between the Ackermann ordinal (Fefermann-Schutte fixed point) and the small Veblen ordinal.
Just wait, one day they'll finally explain the Busy Beaver function BB(n), which grows so fast there literally cannot exist a function that can compute any of its digits. It's insane just how fast it grows. I heard that even getting a lower bound on BB(20000) is impossible in ZFC. Of course, BB(n) is tiny compared to its relativized cousins. And we aren't even out of the lower attic yet. In the middle and upper attic, there are numbers so large that you need to add extra axioms to ZFC in order for them to exist.
@@knightoflambda I think they already did an episode on BB. Scott Aaronson proved that computing BB(~8000) requires proving the (in)consistency of ZFC (basically brute forces some statement that is true IFF ZFC is consistent).
@@knightoflambda actually it is true that BB(n)>TREE(n) for n>k for some k value. But my guess is that "k" is huge itself - I mean it may be bigger than Graham's number. So while it is true that BB is a faster growing function than TREE it doesn't mean that in the region of "normal" numbers BB(n) is bigger than TREE(n) :-)
12:28 My brain just collapsed into a black hole. Edit: Now after seeing the whole video, my brain collapsed into so many black holes that the number of black holes itself collapsed into a black hole and then another black hole and this happened so many times that the number describing it also collapsed into a black hole.
I love how mathematicians get to a point where they're so smart they start making up numbers a 5 year old would spout off and then act profoundly amazed by a finite number within infinity.
Oh man. You should look up the proof of Goodsteins theorem, using trans finite ordinals. Its a statement about sequences of numbers which is proven using ordinals.
All the ordinals that were mentioned in this video were still countable, i.e. they can be viewed as representing a (non-standard) ordering of the natural numbers. That is to say, the transfinite ordinals play the role of intrudcing jumps (in this case the jump is taking the diagonal in the constuction of f's). As such, the cardinalities of any of those ordinals is N, and thus all still smaller than that of the reals R.
@@martinshoosterman Goodstein's theorm is fun. The function that calculates the length of Goodstein sequences has an ordinal of epsilon_0, much bigger than Graham's, but nothing compared to TREE.
i would highly advise against turning the entire observable universe into to strange matter with more than tree(3) trees in every possible location..... Also it would cost a lot of money.
@@Ken-no5ip in the entire observable universe, filled to the limits of the pauli exclusion principle, would not be nearly large enough. Those numbers are just too insanely large.
Even when ignoring the awesome fundraiser, I think this is the coolest video you guys have ever made. Talking about stupidly giant numbers with no physical significance just because it’s fun. I love it, congratulations.
It was quite intuitively obvious to me that Tree(n) was way bigger than g(n), the best way I can describe is that 3 is the first number in the Tree sequence to unlock it's full power, as you always have a first sacrificial colour, so you're kinda playing the game with n-1 colours. 0 colours for n=1 obviously stops, 1 colour for n=2 also has to fundamentally stop really quickly, but for n=3 you finally have 2 colours to play with. If 2 colours already gives the illusion that Tree(3) might be infinite at first glance, and remember this is the first "real" amount of colours to unlock the Tree game, then it only follows that this graph is exploding quicker with any more colours to play with from that point than anything you can make with normal iterations of mathematical functions, no matter how awesome a way you have to write them to become really big.
Also, you only have to climb up to the 3rd branch of the TREE-function to already be off-the-scale massively higher, than g(64), which is the 64th rung on Graham’s ladder.
@@PC_Simo If you look at it through the levels of googology: level 0 is all the single digit and small numbers tending to zero; then level 1 goes from double-digits to a million; then level 2 goes beyond this all the way to a million digits (yes, googol and virtually every number we can practically deal with in our observable universe doesn't even get past level 2); level 3 starts entering the realms of tetration with googolplex and the likes; level 4 goes well beyond googolplexian and so on. You can see how going up just one level in the realms of googology gets to even greater magnitudes much further away than the levels before it. Well, G1 sits around level 6 or 7 and then G64 is much further at level 12, with fw(n) starting here or the level before it (11) let that sink in. So you can see that the difference between 12 levels is the difference between mere counting and shooting past G64 by iterating the number of arrows. Now you run through all the ordinals from omega through epsilon, zeta, eta until you reach the insane gamma-zero; the latter is all the way up to level 100 in the fast-growing hierarchy, meaning that counting to even G(G(...G(64))) [G64 iterations] would be much faster than using the G(n) function (or even f-epsilon0 for that matter) to reach the monsters produced by fgamma-zero(n). However, even then TREE(3) would laugh at this, as it's all the way up in level 120. That's right, an entire 20 levels ahead of fgamma-zero(n), which is insanely further apart than 0-1 and G64 which is merely 12 levels. This means even using fgamma-zero(n) to reach TREE(3) would be much slower (which is still an understatement) than merely counting to G64, even if you were to count in base 1/G64.
I'm no mathematician, but thanks to your past videos I laughed out loud when I saw what this one was about, knowing we were in for another round of "STUPID big"!
@@pluto8404 no, if it weren't for those people to initiate it and produce unified content on the topic. such an effort wouldn't be possible uncoordinated.
I love the hint of fear that trickles through his enthusiasm when discussing the functions over Gamma-Naught: "We must tread lightly here, lest we disturb the Old Ones who dwell in these regions..."
I read a cool description of Graham's number somewhere, in terms of trying to picture it in universal physical terms. If my memory serves me, it went like this: It said that even the integer describing the number of digits in Grahams number could not be represented if you made every particle in the universe a digit, and the same would be true for the number of digits in THAT number, and even if you went down that "number-of-digits-in-the-previous number" scale, with each level down being represented by a single particle in the universe, you still would not able able to fit it into the known universe. I wish I could find that again.
Your original videos on Graham’s number are what got me so into googology in the first place. I can’t express how incredible it feels to see a Numberphile video on the fast-growing hierarchy! I love your videos so much!
Im terrible at math but I'm facinated at how incomprehensible these numbers are and how i still feel that somehow i could fathom it knowing i never will.
Loved this video. The like button wasn’t enough for me. I’ve always used to do this sick thing of imagining very very big numbers, steps and distances since I was 5-6 y/o and it got to a point that I had to stop doing that. This video made me feel a part of my life which I’ve never been able or tried to share with someone else. I reply “speed” when I’m asked about my favorite thing in the world, and they think I just like to drive fast. In fact, I mean exponential growth of exponential growth of .... .
I understand that feeling very well... im not sure about it being my favourite, but i do get excitedly anxious, it kinda hurts, about this sort of big...ness It's so unthinkably big, profoundly and absolutely indescribable... art, it seems, like the cosmic horror style of storytelling, is the only thing that can "properly" assign some meaning to this feeling, maybe precisely because it forgoes logic. Art, and mathematics.
This reminds of dreams I have when I have a fever... A tiny point would suddenly explode to gargantuan size, then compound upon its own size, until it filled my mind. Or marbles would arrange themselves into huge sparse, patterns while multiplying all the time....
I looked up how to express TREE(3) in terms of Gx. Here is the lower bound: G3[187196]3 (compared to G3(64)3). No wonder the growth is so astounding with TREE(x).
That doesn't seem right at all, you can't express the value of TREE(3) in a function that grows infinitely slower than the TREE(3) function, just as you can't express the value of Graham's Number in any F(finite ordinal).
I'd love to see more explanation videos on these higher level infinities. Also, despite being messy, I'm so curious about what stuff comes after Gamma Zero (or f(gamma zero)! I come back to this video a lot. how big numbers can get is so interesting to me.
I'd really like Numberphile to do at least one more video on TREE(3). Specifically, I still don't quite get how it grows so quickly. Maybe if I saw more examples using 3 seeds I'd get it? Not sure. It seems like either it should be infinite or the number would be smaller with 3 seeds. Graham's Number seemed a lot more logical in the way it's built up. With TREE(3) I still feel like I'm being asked to just take it on blind faith that it's really, really big.
the thing I dislike about numberphile is that they never explain how people figured out anything and so you're just left feeling as though you didn't really learn anything but instead just heard of something
Its pretty easy for folk like me with an IQ of 80 so these folks with IQ nearly fifty percent higher can understand these numbers and the growth rate by which numbers are made. That is true but the FGH they mention in this video is like addition compared to the highest ordinal they mentioned ok said video. This process goes on for infinity. So absolutely infinity can't exist since there is more than an infinite amount of such.
Tree(3) may be universes beyond G64 in size, but G64 is a LOT easier to understand how it is generated, even though we can't even begin comprehend its size. I can't even begin to comprehend how Tree(3) is computed!
Just the fact that no finite f(n) hierarchy could describe the growth rate of Graham's number, let alone TREE(n), blows mind mind. Truly shows how unimaginably large those numbers are.
This is a tremendous video, thank you Brady and Ron! With TREE and G and Busy Beaver numbers, I've always wondered how to categorically compare their growth. BTW, you should totally do a video on the Busy Beaver number sequence!
What about this one: TREE(TREE(TREE(TREE(...(TREE(3))...)))) with g(g(g(g(....(g(64))...))))) TREEs Where there are TREE(3) g-s (Yes I know that there are much bigger names number then this)
One interesting thing is that not one could describe the *difference* between those kind of monster numbers without using substraction. I mean, we can construct numbers likeTREE(g(64)) and g(TREE(64)), just with addition, multiplication, exponentiation, and so forth, but no one can ever describe a procedure that could compute or even approximate their difference *d* = g=TREE(g(64)-g(TREE(64)) in finite time without using the substraction operation. I claim that this number, *d* simply does not exist. I claim that, against all appearances, the set of integer numbers is essentially full of void and maybe even it could be that card(N) is finite.
17:00 - 22:00 is literally just 5 minutes of woah massive HuUgGeEeE wowowowow gamma! alpha!! epsilon OF epsilon!!! UNIMAGINABLY you just can't even WOW it's MATH!!!!!!
Isn't it still a small number though? I mean it's hard to imagine but it's a lot closer to 0 than it is to the infinite numbers larger than it. Relative to all numbers, it is a very small number. It's just a number that is larger than we have need for use of.
I wood've axpected better joaks here. Yule never be poplar sitting on your ash resting on your laurels. Teak some pride in your work, fir crying out loud!
This could be perfectly fine in the context of the quote, as tai lung thought he would defeat the dragon warrior, but in fact got stomped as if he was nothing. Later in the fight: “The Wu Shi finger hold?!?!?! Shi Fu didn’t teach you that!!!!!!!” “Nah, I figured it out. Scadoosh!!”
@@jolez_4869 Even TREE(TREE(3)) won't match SSCG(3). SSCG is for 'simple sub-cubic graph,' and it works similarly to the tree problem and resulting function, except there are fewer rules for simple sub-cubic graphs, making more graphs possible, and therefore (much, much, much...) longer sequences. SSCG(n) forms a similar sequence to TREE(n) (in that it describes maximum lengths of non-repeating sequences for a given number of tags, and in starting small and exploding by n=3), but outpaces it easily -- SSCG(3) is greater than TREE(TREE(TREE(TREE(TREE(...TREE(3)))))) -- if you nested that TREE(3) layers deep. TM,DR (Too math, didn't read) -- there's always a bigger function.
Supporting #TeamTrees on a quest to plant 20 million trees - www.teamtrees.org/
Original brown papers from this video available to support the campaign - bit.ly/brownpapers
Numberphile you should do tree 20 million
Tree(20,000,000)
Oh can you do a video on SCG(13)?
*_ＷＨＹ ＩＳ ＴＨＥＲＥ ＩＮＦＩＮＩＴＥ ＦＩＮＩＴＥ ＮＵＭＢＥＲＳ?!_*
More googology please :3
A couple years ago, I planted a tree
After one year, it was 1m tall
After two years, it was 3m tall
How tall will it grow in year 3?
We are gonna die
Sit on top if you want to evade tax forever
* tree pierces the outer shell of the universe *
@@petergriffinhentai4724 lol
Can you please show me a spread sheet with the heights that the tree has had Not just exactly 1 year after you planted it and exactly 2 years after you planted it but also provide values between 0 years after you planted it and 1 year after you planted it and values between 1 year after you planted it and 2 years after you planted and all the way to now. Ps it should not be too hard to figure out the heights for whole numbers like 0,1,2,3,4... even if some of them you have to use a weird mathematical function to show the answer (Like even weirder than power towers.).
5:16 "You're giving the TREE more juice". This was the funniest, most succinct way to describe the same intuition I had!
I'm not sure what the term is for "rate expansion".
For now "rate expansion" = juice.
Juicing the equation
I thought of it like this. The tree function gives much larger values than the g function. So at the enormous scales that we're talking about, all that matters is what is inside the tree function. So tree(g64) is better than g(tree(64)) because you're giving a bigger number to tree. It doesn't even matter what g is doing at this point.
...in other words, giving the juice to TREE, not g 😉. Give that tree more juice!
some would say he gave it more sauce, not juice
So sure, Tree(Graham’s Number) is big. But I have just been exploring the harmonic series (1 + 1/2 + 1/3 + 1/4 + 1/5 …). It is divergent. It takes around 10^43 terms just to get it to sum to a hundred, and it gets way way slower after that.
So my number (‘Geoff’s Number’ if no one has claimed this before) is:
“The number of terms required for the harmonic series to sum to Tree (Graham’s Number)”.
Pin this comment
@Joji Joestar I’ll have to take your word on that. Sounds big.
@@GeoffBeggswell 1+1/2+1/3+...+1/n approximately ln(n)+euler m constant and the approximation gets better and better the larger the n. Because tree(g(64)) is so massive, e^(tree(g(64)-euler m constant) number of term is super sccurate approximation
@@GeoffBeggs yes, it is the same size as TREE(Graham’s number). When you are dealing with numbers this big, raising them to a power doesn’t make much difference.
My number is:D(D3)3
Now this video lives up to the name Numberphile.
Indeed, in math, chess, soccer and boxing, *drive* is important to "win" ;-)
@@MrBlaDiBla68 wot
"But I don't need to stop!" He's gone mad with power.
don;'t
*math
@Nicholas Natale yes.
I've gone madder.
Yes. Next, he’ll go mad with tetration. 😅😮😨😱🤯
This is absolutely the best explanation I've seen of just how much more massive TREE(3) is than g64.
If you look at it through the levels of googology: level 0 is all the single digit and small numbers tending to zero; then level 1 goes from double-digits to a million; then level 2 goes beyond this all the way to a million digits (yes, googol and virtually every number we can practically deal with in our observable universe doesn't even get past level 2); level 3 starts entering the realms of tetration with googolplex and the likes; level 4 goes well beyond googolplexian and so on. You can see how going up just one level in the realms of googology gets to even greater magnitudes much further away than the levels before it. Well, G1 sits around level 6 or 7 and then G64 is much further at level 12, with fw(n) starting here or the level before it (11) let that sink in. So you can see that the difference between 12 levels is the difference between mere counting and shooting past G64 by iterating the number of arrows. Now you run through all the ordinals from omega through epsilon, zeta, eta until you reach the insane gamma-zero; the latter is all the way up to level 100 in the fast-growing hierarchy, meaning that counting to even G(G(...G(64))) [G64 iterations] would be much faster than using the G(n) function (or even f-epsilon0 for that matter) to reach the monsters produced by fgamma-zero(n). However, even then TREE(3) would laugh at this, as it's all the way up in level 120. That's right, an entire 20 levels ahead of fgamma-zero(n), which is insanely further apart than 0-1 and G64 which is merely 12 levels. This means even using fgamma-zero(n) to reach TREE(3) would be much slower (which is still an understatement) than merely counting to G64, even if you were to count in base 1/G64.
I’ve got a large number I’m working on called ‘yo mama’
19:15 - “if omega’s so great, why isn’t there an omega 2, huh?”
19:20 - “oh ok I’ll shut up now”
Incidentally, this doesn't work for uncountable ordinals, like omega_2.
*Omega timea 2 wants to know your location*
sugarfrosted
Yeah, it only works up to ε_0. (ω^ω^ω^ω^...)
Wut about cantor's ordinal?
Omega acting all gangsta until Epsilon arrives.
Remember this meme?
Marvel: Infinity War is the most ambitious crossover in history.
Numberphile: TREE(Graham’s Number).
Nah, let's do TREE(TREE(TREE(...TREE(g64)...))), where TREE is repeated G64 times.
@@MuzikBike why stop there? why not repeat it TREE(G64) times? Or TREE(TREE(G64)) times?
Or just the crossover of Numberphile and Mr Beast.
@@sinom how bout ∞?
What if we planted TREE(g64) trees?
Man I love this guy's charisma, he's so genuine.
His book is amazing as well: "Fantastic numbers and where to find them."
@@notmarr2000 can you like this comment just to remember myself to buy it?
@@fernandourquiza4593 the book is utterly mind blowing. I am half through (last chapter "Graham's Number, current chapter TREE (3)). The book is more than about math - he gets into a lot of physics, the concept of how big would the universe have to be before you would find an exact double of yourself, is the universe that big? Ect.
@@fernandourquiza4593 4th like after 8 months just checking in if you bought it 😄
"TREE vs Graham's Number" is basically clickbait for mathematicians
I mean yeah it’s clickbate but in fairness they weren’t lying
TREE won by a landslide... A landslide of orders of infinities!
no coz if u know this its obvious whats bigger and u gain nothing new from the vid. but people who didnt knew can gain something
I'm not mathematically smart.......but i due enjoy learning about big numbers and I mean BIG numbers like the ones larger than the ones in this video. Like Fish number, etc
The Gogeta vs Broly of the math world
Aleph-null bottles of beer on the wall, aleph-null bottles of beer, take one down, pass it around, aleph-null bottles of beer on the wall.
Best part is that "aleph-null" has the same number of syllables as "ninety-nine." So the rhythm keeps up!
that's a lovely one
unfortunately subtraction isn't defined for infinite cardinals
Infinity (aleph null) minus one is infinity
Klein bottles?
It's crazy that such a simple "game" to explain, like TREE(n), which you may easily explain to even a first grader, is so insanely more powerful than even Γ₀, which requires pretty advanced mathematics to even begin conceptualizing.
Mathematics is beautiful!
TREE(n) lies between the SVO and LVO in fast growing hierarchy. The SVO is lower bound and LVO the upper bound. It is much closer to the SVO but slightly faster than that
The SVO and LVO is just ridiculous just to let you know. If you want i can link a video to explain these ordinals. Then you will understand why Tony said in the video that anything beyond gamma gets messy😂😂
@@R3cce sound fun , link pls.
@@R3cce If you look at it through the levels of googology: level 0 is all the single digit and small numbers tending to zero; then level 1 goes from double-digits to a million; then level 2 goes beyond this all the way to a million digits (yes, googol and virtually every number we can practically deal with in our observable universe doesn't even get past level 2); level 3 starts entering the realms of tetration with googolplex and the likes; level 4 goes well beyond googolplexian and so on. You can see how going up just one level in the realms of googology gets to even greater magnitudes much further away than the levels before it. Well, G1 sits around level 6 or 7 and then G64 is much further at level 12, with fw(n) starting here or the level before it (11) let that sink in. So you can see that the difference between 12 levels is the difference between mere counting and shooting past G64 by iterating the number of arrows. Now you run through all the ordinals from omega through epsilon, zeta, eta until you reach the insane gamma-zero; the latter is all the way up to level 100 in the fast-growing hierarchy, meaning that counting to even G(G(...G(64))) [G64 iterations] would be much faster than using the G(n) function (or even f-epsilon0 for that matter) to reach the monsters produced by fgamma-zero(n). However, even then TREE(3) would laugh at this, as it's all the way up in level 120. That's right, an entire 20 levels ahead of fgamma-zero(n), which is insanely further apart than 0-1 and G64 which is merely 12 levels. This means even using fgamma-zero(n) to reach TREE(3) would be much slower (which is still an understatement) than merely counting to G64, even if you were to count in base 1/G64.
@@AymanTravelTransport
According to Googology, the TREE sequence has the ordinal of (SVO times Omega) in the fast growing hierarchy
Brady's "more juice power" proof. I like it.
Graham-ade, it's got what TREE craves!
it's rigorous enough for me!
So do I 🧃.
P.S. You’re welcome for your 512th like. 👍🏻
@@DFPercush Exactly 👌🏻🎯😅.
@@bigpopakap Same here 😌.
"Anything beyond gamma zero gets really messy." Yes, all was beautifully in order before then ;)
Ironic that they're called "ordinals"
I can confirm this, many post gamma zero notations are off the scale complex for new people to understand
Gamma gamma zero (;
@@chaohongyang actually, its ridiculously easy to go past it.
@@j.hawkins8779 Add 1
"This next guy, I'm not going to write it out, because it has 121 million digits."
This has to be in the top ten Numberphile videos of all time. Maybe top three even?
Top TREE
I remember, on the schoolyard, when the biggest number was “a BAZILLION”🤯
Bazillion + 1.
@@boudicawasnotreallyallthat1020 I don't mean to obliterate you.. but I raise you 2 bazillion.
....2 bazillion plus infinity🙀🙀🙀🙀
@@xexpo 2 bazillion-fantastillion
I remember it being "uncountable"
If each of my brain cells was a brain, lets just call that an omega brain, I still wouldn't understand this.
This makes my brain feel like it is a brain cell.
Yeah, but what if each of your brain cells contained as many brains, as your brain has brain cells? No, wait, what if each of your brain cells contained as many brains, as the number of possible permutations on the set of all brain cells in all of the brains in all universes real and imaginary? No, wait, what if all brains were like that, and then what if each of your brain cells could produce that many new brains per nanosecond, for each possible permutation on the set of all of the brain cells in all of those brains?
😂
If I had a TREE(g(Γ₀!))-brain for every 1/(TREE(g(Γ₀!))) Planck Volume within the known universe (let's just call that a Ж-brain), and then had Ж Ж-brains for every one of those,
I would probably die.
@@jonadabtheunsightly Even if each of those brains had the combined capacity of the greatest scientists in the history of humanity, you still wouldn't come close to comprehending these numbers
Fascinating that g and TREE are so fast growing that you need transfinite ordinals to put them in a hierarchy. This is probably the best way to convey their power.
They pulled out ordinal collapsing functions on us. They really brought the big guns for this fundraiser.
And yet they didn't get to Aleph-one
A Large countable ordinal, but not quite an ordinal collapsing function.
Ordinal what?
Well they didn't even talk about fundamental sequences
It's all about the juice
Last time on Number Ball Z!
Graham’s Number: “It’s no use, he’s too strong!”
TREE (3) : “We have one option. We have to combine!”
@Nix Growham
It's not even his final form!!
It's over 9,000!
@@omri9325 WHAT 9000?!
@@omri9325 I mean, you are technically correct.
I'm at just over 14 minutes and am going to have to rest my mind and finish this tomorrow. Have just watched the 2 videos on tree(3) beforehand. This feels like staring into the abyss and it's rather terrifying, and as well, my mind feels like it's melting down from struggling to comprehend such enormity. Who knew that maths could get kind of terrifying?!
_looking at all the youtubers making tree videos_
"Oh yeah. It's all coming together."
although some trees were probably harmed due to the amount of brown paper used here
Hey it’s me you stole my comment cool idc
Germaphobe I don’t care tho
Nothing beats this one since pretty sure none of the others could come up with something like TREE(3)
Is it me, or does 20 million suddenly sound like a pathetically small number
time to plant TREE(3) trees
Time to plant TREE(TREE(TREE(....tree(64) times...))) trees
120million digits sounds like nothing at all, given what they are looking at
That's basically a day's worth of disposable chopsticks in China.
Thanks internet, Now Chinese can enjoy eating for an extra day.
Actually first thing I thought when I heard about that project was:"20 million threes are not so much at all"
This is the most intense AND my favorite part of this whole channel.
The mathematicians went out of control, somebody please stop them
NEVER
no
Not their fault - one of them SUPER busy beavers outta control!...
No
“Well, the problem is that you’re just dealing with finites.”
This problem is indeed found in so many situations.
Newton/Leibniz be like this when inventing calculus.
A problem when looking at my account balance
I encounter this problrem when paying for my gaughter's tutors)
Sounds like a racist statement :(
The only finite thing that's a problem is the finite nature of human intelligence.
It's amazing that even without the ordinal Mathematics, we can still tell that TREE function grows (way) more quickly than Graham's function. TREE(n) literally goes from 1 to 3 to something that is way way way way way bigger than Graham's number, while G(n) needs 64 layers to go from 3^^^^3 to Graham's number. It's absolutely safe to say that at least the numbers G(1) to G(64) are all within the gap between 3 and TREE(3). The jumping between G(n) is essentially stationary compared to that between TREE(n).
Exactly 👌🏻.
G(0) is also 4 so basically the entire graham sequence
@@caringheart34 I thought the same thing 🎯.
@@PC_SimoTREE(n) grows at a rate between the SVO and LVO in fast growing hierarchy.
These ordinals are beyond gamma. I can link a video to explain these ordinals if you want. You will then understand why Tony said in this video that anything beyond gamma gets messy😂
Things can start slowly then get really big later though. Tree is still a computable function. The Busy Beaver function has pretty reasonable values for small values, but it grows much faster than any computable function.
The paper change is the real reason we watch this channel.
Yep. That joke's got layers, man.
Ummm... Not true....
It's the one thing here I can comprehend
@@pleasuretokill same
The jingle on it keeps me living
Recommended reading for the course - Vsauce's How to count past infinity.
Dyani K. Seriously. That video's the only reason I had the slightest understanding of the omega stuff.
If I haven't already seen that video I would have no clue what I was watching.
Yea that inspired me to watch this numberphile video.
Vsauce, where we give disingenuous answers to clickbaity loaded questions without ever explaining what's fundamentally wrong with them.
@@billvolk4236 dude, what is your problem
22:51 Yoooo that is actually scary. I knew TREE was big, but I did not expect that.
TREE(n) is believed to grow at least as fast as the Small Veblen Ordinal or SVO for short. SVO is beyond Gamma in strength
@R3cce It more than likely isn’t anywhere close. SVO just covers a lot of area within ordinal collapsing functions so it more than likely grows faster than TREE(n), it’s just nobody really knows so they slap it on SVO because it’s the best estimate. The only thing we do know is it is between the Ackermann ordinal (Fefermann-Schutte fixed point) and the small Veblen ordinal.
The TREE function impresses me everytime. It's so simple yet it blows everything away.
Just wait, one day they'll finally explain the Busy Beaver function BB(n), which grows so fast there literally cannot exist a function that can compute any of its digits. It's insane just how fast it grows. I heard that even getting a lower bound on BB(20000) is impossible in ZFC. Of course, BB(n) is tiny compared to its relativized cousins. And we aren't even out of the lower attic yet. In the middle and upper attic, there are numbers so large that you need to add extra axioms to ZFC in order for them to exist.
@@knightoflambda what is the most faster growing fiction in googology?
@@knightoflambda I think they already did an episode on BB. Scott Aaronson proved that computing BB(~8000) requires proving the (in)consistency of ZFC (basically brute forces some statement that is true IFF ZFC is consistent).
@@knightoflambda they mentioned and explained some Busy Beaver stuff in the video about Rayo's number
@@knightoflambda actually it is true that BB(n)>TREE(n) for n>k for some k value. But my guess is that "k" is huge itself - I mean it may be bigger than Graham's number. So while it is true that BB is a faster growing function than TREE it doesn't mean that in the region of "normal" numbers BB(n) is bigger than TREE(n) :-)
12:28 My brain just collapsed into a black hole.
Edit: Now after seeing the whole video, my brain collapsed into so many black holes that the number of black holes itself collapsed into a black hole and then another black hole and this happened so many times that the number describing it also collapsed into a black hole.
and so onnnn
P O T A T O
I love how mathematicians get to a point where they're so smart they start making up numbers a 5 year old would spout off and then act profoundly amazed by a finite number within infinity.
Mathematicians after creating the number galleohalivitoxipityisnlotopiscisis22: 😮
Never thought transfinite ordinals could be useful with something finite like sequences of integers.
Amazing video!
Oh man. You should look up the proof of Goodsteins theorem, using trans finite ordinals.
Its a statement about sequences of numbers which is proven using ordinals.
All the ordinals that were mentioned in this video were still countable, i.e. they can be viewed as representing a (non-standard) ordering of the natural numbers. That is to say, the transfinite ordinals play the role of intrudcing jumps (in this case the jump is taking the diagonal in the constuction of f's). As such, the cardinalities of any of those ordinals is N, and thus all still smaller than that of the reals R.
@@martinshoosterman Goodstein's theorm is fun. The function that calculates the length of Goodstein sequences has an ordinal of epsilon_0, much bigger than Graham's, but nothing compared to TREE.
"This is starting to terrify me now."
"But I don't need to stop!"
ITS TIME TO STOP
@@jolez_4869 laughed too hard at that
That guy: Reaches an Unthinkably fast growing function that starts to bend the fabric of space-time.
Also That guy: i CaN CArRy oN...
Please...please stop. In the name of sanity please stop
Don't go into the TREES stop stop.
These big number videos make me unimaginably excited...
Every other RUclipsr: "let's plant 20,000,000 trees!" Numberphile: “let's plant TREE(Graham’s Number)!”
Not enough matter in the conceivable universe to plant that many trees
i would highly advise against turning the entire observable universe into to strange matter with more than tree(3) trees in every possible location..... Also it would cost a lot of money.
BACHOMP There probably isnt enough quarks to reach that number
@@Ken-no5ip in the entire observable universe, filled to the limits of the pauli exclusion principle, would not be nearly large enough. Those numbers are just too insanely large.
that factorial at the end
David Metzler has an excellent 40 part series on the fast growing hierarchy, ordinals and much much further.
I thought this was a joke until I looked it up. Well, now I know what I'll be doing for the next month.
There's also Giroux Studios
@@OrbitalNebula And you, btw you need to make more FGH vids, they are so damn gud
Oh yeah. I'm now actually on the progress of making the next big numbers vid. It's just taking me quite long to make.
@@OrbitalNebula i fully support you, do whatever you want at your own pace homie :)
21:17 you can’t fool me, you’re just drawing squiggles now
Even when ignoring the awesome fundraiser, I think this is the coolest video you guys have ever made. Talking about stupidly giant numbers with no physical significance just because it’s fun. I love it, congratulations.
This is literally the biggest collaboration in RUclips history.
And it's for the best possible cause.
I'm genuinely proud of this community.
Me too. This's a 10 out of 10 for Humanity today.
@@erik-ic3tp is 20 million trees a lot of trees?
Google User, Yes.🙂
At this point, you can't even compare g(TREE(3)) even with TREE(4) because of how much faster TREE grows
TREE(4) is much larger than g(g(g(…g(TREE3)..) TREE(3) number of times
I remember the VSauce video on Ordinal Numbers and Infinities; I was prepared for this one. Still amazing that TREE grows even faster than that!
20:40 funny how its called epsilon 0 cause usually epsilon is used for small numbers
MILDLY INTERESTING
Thats \varepsilon
It was quite intuitively obvious to me that Tree(n) was way bigger than g(n), the best way I can describe is that 3 is the first number in the Tree sequence to unlock it's full power, as you always have a first sacrificial colour, so you're kinda playing the game with n-1 colours. 0 colours for n=1 obviously stops, 1 colour for n=2 also has to fundamentally stop really quickly, but for n=3 you finally have 2 colours to play with.
If 2 colours already gives the illusion that Tree(3) might be infinite at first glance, and remember this is the first "real" amount of colours to unlock the Tree game, then it only follows that this graph is exploding quicker with any more colours to play with from that point than anything you can make with normal iterations of mathematical functions, no matter how awesome a way you have to write them to become really big.
Also, you only have to climb up to the 3rd branch of the TREE-function to already be off-the-scale massively higher, than g(64), which is the 64th rung on Graham’s ladder.
@@PC_Simo If you look at it through the levels of googology: level 0 is all the single digit and small numbers tending to zero; then level 1 goes from double-digits to a million; then level 2 goes beyond this all the way to a million digits (yes, googol and virtually every number we can practically deal with in our observable universe doesn't even get past level 2); level 3 starts entering the realms of tetration with googolplex and the likes; level 4 goes well beyond googolplexian and so on. You can see how going up just one level in the realms of googology gets to even greater magnitudes much further away than the levels before it. Well, G1 sits around level 6 or 7 and then G64 is much further at level 12, with fw(n) starting here or the level before it (11) let that sink in. So you can see that the difference between 12 levels is the difference between mere counting and shooting past G64 by iterating the number of arrows. Now you run through all the ordinals from omega through epsilon, zeta, eta until you reach the insane gamma-zero; the latter is all the way up to level 100 in the fast-growing hierarchy, meaning that counting to even G(G(...G(64))) [G64 iterations] would be much faster than using the G(n) function (or even f-epsilon0 for that matter) to reach the monsters produced by fgamma-zero(n). However, even then TREE(3) would laugh at this, as it's all the way up in level 120. That's right, an entire 20 levels ahead of fgamma-zero(n), which is insanely further apart than 0-1 and G64 which is merely 12 levels. This means even using fgamma-zero(n) to reach TREE(3) would be much slower (which is still an understatement) than merely counting to G64, even if you were to count in base 1/G64.
I'm no mathematician, but thanks to your past videos I laughed out loud when I saw what this one was about, knowing we were in for another round of "STUPID big"!
This was geniunely one of my favorite videos ever to have been uploaded to this channel.
I fully agree 👍🏻.
one thing that i find interesting is that tree(65) is already way bigger than g(tree(64))
in the first 3 hours they are past 1 Million, hope this keeps afloat for a while
It's mind-blowing what crowdfunding could do if done right.
@@erik-ic3tp it's a giant collaboration, so that is unprecedented.
@@Veptis "collobaration"
you mean the 1% sit back and take all the credit while their followers donate all the money.
@@pluto8404 no, if it weren't for those people to initiate it and produce unified content on the topic. such an effort wouldn't be possible uncoordinated.
@@Veptis I suppose we do need a large unification to combat all the carbon their Manson's and sports cars put out.
I love the hint of fear that trickles through his enthusiasm when discussing the functions over Gamma-Naught: "We must tread lightly here, lest we disturb the Old Ones who dwell in these regions..."
"512, quite big number"
7:10
LOLOLO
Compared to the number in this video there is like no difference between 512 and -googleplex
Best Numberphile video in a while, but NOT for the faint of heart.
One of the best videos of Numberphile!
The fact that Tree(G64) is still smaller than Rayo's number is just crazy
So nice to see so many channels contribute to #TeamTrees
You have combined my two favorite numberphile videos! Thank you!
I read a cool description of Graham's number somewhere, in terms of trying to picture it in universal physical terms. If my memory serves me, it went like this: It said that even the integer describing the number of digits in Grahams number could not be represented if you made every particle in the universe a digit, and the same would be true for the number of digits in THAT number, and even if you went down that "number-of-digits-in-the-previous number" scale, with each level down being represented by a single particle in the universe, you still would not able able to fit it into the known universe. I wish I could find that again.
In fact, g(1) itself, defined as 3↑↑↑↑3, is bigger than googolplexplex...plexplex (with googolplex 'plex'es)
In fact, the number of digits in Graham's number is approximately Graham's number...
its on wikipedia
For sure one of the best videos on my favorite channel.
Such elegant insanity.
Love it!
Your original videos on Graham’s number are what got me so into googology in the first place. I can’t express how incredible it feels to see a Numberphile video on the fast-growing hierarchy! I love your videos so much!
Im terrible at math but I'm facinated at how incomprehensible these numbers are and how i still feel that somehow i could fathom it knowing i never will.
Loved this video. The like button wasn’t enough for me. I’ve always used to do this sick thing of imagining very very big numbers, steps and distances since I was 5-6 y/o and it got to a point that I had to stop doing that. This video made me feel a part of my life which I’ve never been able or tried to share with someone else.
I reply “speed” when I’m asked about my favorite thing in the world, and they think I just like to drive fast. In fact, I mean exponential growth of exponential growth of .... .
I understand that feeling very well... im not sure about it being my favourite, but i do get excitedly anxious, it kinda hurts, about this sort of big...ness
It's so unthinkably big, profoundly and absolutely indescribable... art, it seems, like the cosmic horror style of storytelling, is the only thing that can "properly" assign some meaning to this feeling, maybe precisely because it forgoes logic.
Art, and mathematics.
iUFOm, Same for me too.😊
That's beautiful.
Have you ever watched the Vsauce video "How To Count Past Infinity"?
NoriMori, I’ve watched it yes.🙂
This reminds of dreams I have when I have a fever...
A tiny point would suddenly explode to gargantuan size, then compound upon its own size, until it filled my mind.
Or marbles would arrange themselves into huge sparse, patterns while multiplying all the time....
Newer thought there would be something so out of world and so "same" at the...same...time.
U are not alone.
Also this dream has a very bad taste.
i hate this dream for no reason...
That's why I stopped doing drugs.
This is one of the most mind blowing mathematical things I have ever seen. This is completely outrageous!
I looked up how to express TREE(3) in terms of Gx. Here is the lower bound: G3[187196]3 (compared to G3(64)3). No wonder the growth is so astounding with TREE(x).
That doesn't seem right at all, you can't express the value of TREE(3) in a function that grows infinitely slower than the TREE(3) function, just as you can't express the value of Graham's Number in any F(finite ordinal).
@@Dexuz TREE(n) is between the SVO and LVO in fast growing hierarchy
@Dexuz I agree, but I'm reporting what I looked up, I wouldn't dare claim to have calculated such a thing!
theres no proof it's between those@@R3cce
The amount of times I just yelled "No way!" alone in my room is only slightly embarrassing.
lol
I'd love to see more explanation videos on these higher level infinities. Also, despite being messy, I'm so curious about what stuff comes after Gamma Zero (or f(gamma zero)!
I come back to this video a lot. how big numbers can get is so interesting to me.
The Small Veblen Ordinal (SVO) is the next ordinal after Gamma zero. After the SVO comes the Large Veblen Ordinal (LVO)
You can go beyond gamma zero.
f gamma zero: "This isn't even my final form!!!"
Yeah. As far as I know you can go as far as f ω₁ ie, you can have f of anything smaller than ω₁ but you cannot define f for ω₁
@@martinshoosterman yes but you surely can’t have an f of an inaccessible cardinal right?
@@donandremikhaelibarra6421 you can't even do f(omega_1) much less an inaccessible cardinal.
@@martinshoosterman is the inaccessible cardinal bigger than an infinite amount of alephs nested together?
Just got flashbacks to the vsause vid about ordinal numbers
But his video was about cradinals
same lol
Was reminded about aleph
When I was in engineering classes, I would have LOVED to have him as my teacher.
I'd really like Numberphile to do at least one more video on TREE(3). Specifically, I still don't quite get how it grows so quickly. Maybe if I saw more examples using 3 seeds I'd get it? Not sure. It seems like either it should be infinite or the number would be smaller with 3 seeds. Graham's Number seemed a lot more logical in the way it's built up. With TREE(3) I still feel like I'm being asked to just take it on blind faith that it's really, really big.
Even TREE(4) is bigger than GGG….G(TREE(3)) where the number of G iterations is TREE(3) itself. Just to show how fast TREE(n) grows
Ever heard of SSCG(3)? It’s even bigger than TREE(TREE(…..(TREE(3)) with TREE(3) iterations of TREE
the thing I dislike about numberphile is that they never explain how people figured out anything and so you're just left feeling as though you didn't really learn anything but instead just heard of something
I agree, but I understand why they don't.
Its pretty easy for folk like me with an IQ of 80 so these folks with IQ nearly fifty percent higher can understand these numbers and the growth rate by which numbers are made. That is true but the FGH they mention in this video is like addition compared to the highest ordinal they mentioned ok said video. This process goes on for infinity. So absolutely infinity can't exist since there is more than an infinite amount of such.
Half this video is just Tony trying to find words to express the magnitude of these sizes, and we love it
And as everyone knows we get Omega-3 from fish. So this video is telling me: plant Trees using fish.
a herring!
@@DFPercush *jarring chord*
i hate this joke
I've genuinely got goosebumps
Edit: lol thanks for the 7 likes. I have a question tho...
Tree(x) > G(tree(3))
What's the smallest x?
4
Tree(3) may be universes beyond G64 in size, but G64 is a LOT easier to understand how it is generated, even though we can't even begin comprehend its size. I can't even begin to comprehend how Tree(3) is computed!
We need an extra footage video about Ordinal Collapsing functions
Ah the iconic “Paper Change” music returns
How do folks wrap their brains around adstracts like this? So cool!
for more on ordinals go watch VSauce's video "counting past infinity"
RUclips: Let's all talk about trees.
Numberphile: Challenge accepted
Just the fact that no finite f(n) hierarchy could describe the growth rate of Graham's number, let alone TREE(n), blows mind mind. Truly shows how unimaginably large those numbers are.
Finally, a worthy opponent!
Our battle will be legendary!
Making all these videos Brady practically became a mathematician.
This is a tremendous video, thank you Brady and Ron! With TREE and G and Busy Beaver numbers, I've always wondered how to categorically compare their growth. BTW, you should totally do a video on the Busy Beaver number sequence!
4:24 I didn’t know I miss the paper change so much until I see one
When I get to Heaven, I hope to have a computer that can handle numbers like TREE(g(64)).
Maybe Heaven is a computer that can handle numbers like TREE(g(64)).
What about this one:
TREE(TREE(TREE(TREE(...(TREE(3))...))))
with g(g(g(g(....(g(64))...))))) TREEs
Where there are TREE(3) g-s
(Yes I know that there are much bigger names number then this)
Yet there are uncomputable numbers.
TREE(n) is uncomputable.
@@lumi2030 I don't think it is, but I will look it up
Edit: it is computable
One interesting thing is that not one could describe the *difference* between those kind of monster numbers without using substraction. I mean, we can construct numbers likeTREE(g(64)) and g(TREE(64)), just with addition, multiplication, exponentiation, and so forth, but no one can ever describe a procedure that could compute or even approximate their difference *d* = g=TREE(g(64)-g(TREE(64)) in finite time without using the substraction operation. I claim that this number, *d* simply does not exist. I claim that, against all appearances, the set of integer numbers is essentially full of void and maybe even it could be that card(N) is finite.
I remember being outside his office when they were filming this 😂
Andrew Dawson Truth or lie 🤔
17:00 - 22:00 is literally just 5 minutes of woah massive HuUgGeEeE wowowowow gamma! alpha!! epsilon OF epsilon!!! UNIMAGINABLY you just can't even WOW it's MATH!!!!!!
Isn't it still a small number though? I mean it's hard to imagine but it's a lot closer to 0 than it is to the infinite numbers larger than it. Relative to all numbers, it is a very small number. It's just a number that is larger than we have need for use of.
@@CalvinHikes Yes, it's smaller than almost every other number
@@doicaretho6851 Dont think so, since its defined beyond the cardinal numbers.
So basically every time someone talks about power levels on DBZ.
@@doicaretho6851 Does that mean every single number is relatively small?
18:50 "this terrifies me... but I don't need to stop!"
A true classic
This really exceeds my ability to comprehend.
Don't worry, it exceeds the physical universe's ability to comprehend too.
RUclips should really rename themselves to YewTube at this point, it's been overthrown by trees!
*overgrown
As a dad, I approve this joke
I wood've axpected better joaks here. Yule never be poplar sitting on your ash resting on your laurels. Teak some pride in your work, fir crying out loud!
JewTube may be interpreted as racist. Especially with content about big numbers...
@@yvesnyfelerph.d.8297 Can't tell if this is a joke or...?
The most impressive thing of G(64) is the fact that we're talking of dimensions. How do you travel through G(64) dimensions?
People: there's no way Numberphile can join the #teamtrees thing
Numberphile: hold my beer
Hold my Klein bottle.
@@masterimbecile darn it should have seen that joke
With the amount of paper used in these videos I'd be shocked if they didn't
Well he did use paper...
Hold my juice
Since TREE, Friedman has exhibited an even fast growing function: SSCG. Maybe worth mentioning something about it sometime.
SSCG(3) is even bigger than TREE(TREE(…….(TREE(3))…)) with TREE(3) TREE’s
These videos are so amusing to watch, even for a nerdy med student❤
Oh boy oh boy! I already liked this video, but I'm gonna watch it later when I can give it full attention. Tree v Graham's number, yis!
TREE(g64): exists
g(TREE64): Finally, a worthy opponent. Our battle will be legendary
TREE(TREE(3)) joins the game
But the second number is basically 0 compared to the first number.
This could be perfectly fine in the context of the quote, as tai lung thought he would defeat the dragon warrior, but in fact got stomped as if he was nothing.
Later in the fight: “The Wu Shi finger hold?!?!?! Shi Fu didn’t teach you that!!!!!!!”
“Nah, I figured it out. Scadoosh!!”
@@jolez_4869 Even TREE(TREE(3)) won't match SSCG(3). SSCG is for 'simple sub-cubic graph,' and it works similarly to the tree problem and resulting function, except there are fewer rules for simple sub-cubic graphs, making more graphs possible, and therefore (much, much, much...) longer sequences. SSCG(n) forms a similar sequence to TREE(n) (in that it describes maximum lengths of non-repeating sequences for a given number of tags, and in starting small and exploding by n=3), but outpaces it easily -- SSCG(3) is greater than TREE(TREE(TREE(TREE(TREE(...TREE(3)))))) -- if you nested that TREE(3) layers deep.
TM,DR (Too math, didn't read) -- there's always a bigger function.
@@isaacwebb7918 Wow damn. Thats interesting!
Understanding the math sequence is beyond me. But watching Tony get excited about math is so entertaining.