Here's a big number. It would be interesting to hear how big people think this is relative to other well-known big numbers, like Graham's number.
1) Define a "power tower" operation using the # symbol. Example:
So consists of elements in a power tower, in which each element is .
2) Googol = G =
3) Googolplex =
4) (power tower a googolplex elements high, wherein each element is a googolplex)
is the big number (subscript is the same quantity defined in Step 4)
Here are some more interesting questions:
a) Given characters within some generalized symbolic alphabet, what is the largest finite number that can be defined algorithmically using those characters, and how does the number relate to N?
b) How big a number could you define using a number of characters equivalent to those in the combined works of Shakespeare? Or does the size of the limiting number depend more on the conceptual potency of the method than on the number of characters used?
c) Is there a large-number-generating paradigm more potent than power towers and iteration?