4 ms·
> for a number of times far exceeding the total number of Planck volumes in the observable universe. Just so I'm clear. They're saying that not only can I not
by function_seven 7y ago
> for a number of times far exceeding the total number of Planck volumes in the observable universe.
Just so I'm clear. They're saying that not only can I not fit Graham's Number in all the Planck volumes of the universe; and I can't even count the digits of GN and write that in the Planck volume of the universe (and so on), but the number of "indirections" is itself so large as to not fit in the universe?
Like:
1. GN (can't fit).
2. Number of digits in GN (can't fit).
3. Number of digits in #2 (can't fit).
4. Number of digits in #3 (can't fit).
...
N. <-- The numbered list item itself won't fit.
Am I understanding that right?
- Gunax 7y agoYes. log(log(log... GN))) applied X times (where X is the number of planck volumes in the universe) is still greater than X. Where log = base 10 logarithm. Hofstadter talks a bit about this abstraction in his article 'On Number Numbness' > If, perchance, you were to start dealing with numbers having millions or billions of digits, the numerals themselves (the colossal strings of digits) would cease to be visualizable, and your perceptual reality would be forced to take another leap upward in abstraction-to the number that counts the digits in the number that counts the digits in the number that counts the objects concerned.
- saalweachter 7y agoAnd despite that, Graham's Number is still in the countable set. :-)
- marcosdumay 7y agoIt shouldn't be surprising, because the Graham's Number is all about applying those indirections recursively into more indirections.