Comments by "MC116" (@angelmendez-rivera351) on "TREE(Graham's Number) (extra) - Numberphile" video.
-
6
-
4
-
3
-
3
-
2
-
2
-
2
-
2
-
2
-
2
-
2
-
2
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
Awwkaw You really are forming strong conclusions based on the first sentence of a Wikipedia article of all things? I'm sorry, but if you want to have a serious discussion, that's not going to cut it for anyone. You must be joking if you think I can call that researching a definition. You could at least put a bit more effort, don't you think?
Going down too many dimensions just loses information. I can make a projection of a ball onto a plane to get a disk, but I cannot do the same and get a point or a line. Intuitively, this makes sense, and if you're skeptical, just try thinking about it yourself. You'll end up concluding this yourself. This alone is sufficient to show the amount of dimensions this lower-dimensional boundary has is not arbitrary and cannot be made as small as one wants it. You could do further maths to then show that for must situations, you only can go down 1 dimension, but the maths for that are rather complicated and too much to discuss on YouTube. However, the intuitive idea is there.
1
-
1
-
1
-
1
-
1
-
1
-
1
-
1
-
Chris Sekely There is no such largest number, since arbitrary symbolic notation can be used to express arbitrarily large numbers. We can go to arbitarily high orders of logic to compress expressions as much we want.
More concretely, I can define a function F(n) such that this is equal to the smallest number not representable in x-order logic with n symbols. Then let n be the number of Planck volumes in the universe and I have expressed a large number. Normally, you would want to use the label F_x to specify the order of logic of the function. With this method, there is such a largest number. However, I can circumvent this entirely by simply creating new symbols. Symbolic logic sets no restriction on what symbols I can use, so long as they are part of the language. I can arbitrarily expand the language and add new symbols arbitrarily, which allows me to not need to label the function, but rather just use a new symbol for a higher order logic function. Then any limitations would come from the limit of possible symbols I can use. As far as I understand, though, there is no limit. For any symbol that exists, I can make a new symbol from it.
Okay, I suppose you may be able to come up with such a limitation symbols. But I'm already a step ahead of you: I can define a function such that there is a number not expressible in this type of notation, and I can do so in symbolic logic. In fact, I can define the function F(n) as the smallest number not expressible in n symbols in any lower order of logic with new symbols. And so on. You may have to consider transfinite orders of logic, and so, but you can always go one order higher and form a compression defined explicitly from the limits of the previous orders.
1
-
1
-
1
-
1
-
1
-
1
-
1