Comments by "MC116" (@angelmendez-rivera351) on "TREE(Graham's Number) (extra) - Numberphile" video.

  1. 6
  2. 4
  3. 3
  4. 3
  5. 2
  6. 2
  7. 2
  8. 2
  9. 2
  10. 2
  11. 2
  12. 2
  13. 1
  14. 1
  15. 1
  16. 1
  17. 1
  18. 1
  19. 1
  20. 1
  21. 1
  22. 1
  23. 1
  24. 1
  25. 1
  26. 1
  27. 1
  28. 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
  29. 1
  30. 1
  31. 1
  32. 1
  33. 1
  34. 1