“Numbers” Table of Contents
Part 1: Magnitude
Part 2: Exponentiation
Part 3: Hyper and Knuth Up Arrows
Part 4: Graham’s Number and Conway Arrows
Part 5: Extended Conway Arrows
Part 6: Limit Functions
Part 7: Larger Limit Functions
Part 8: Exponentiation Within Limit Functions
Essentially very small amount of Conway arrows can represent very large numbers, and the number represented get’s much larger with the addition of just one arrow.
can be seen written out in Part 4, but, using Knuth up-arrows, it has an amount of arrows greater than Graham’s Number.
is indescribable in any notation we’ve discussed so far other than Conway’s. It’s equal to
, which expands further to
… It’s unfeasible to write-out this four-arrow expression as anything other than a four-arrow expression. It’s that big!
Larger with Each Arrow
Not only is the number represented getting larger with the addition of each arrow, it’s getting larger at a much increasing magnitude. The gulf between 3 (0 arrows) and 27 (1 arrow) is much different between 27 (1 arrow) and 3 cubed, 7625597484987 times (2 arrows).
And of course the gulf between 2 arrows and 3 arrows is even larger! The difference between something representable by three Knuth up-arrows and something representable only by arrows larger than Graham’s Number.
Now consider the difference between 3 arrows and 4 arrows. It’s unimaginable by any other standard. Then we can keep going to 5 arrows, 6 arrows, 7 arrows… etc. Any number larger than three arrows is too large to be of any mathematical use, but in the FUN TIMES of making large numbers, we need more!
n Conway Right-Arrows
So we can then define any amount of Conway arrows with a new notation.
And then we can apply the same definitions and rules of the old arrows to the new arrows.
For example,
That didn’t produce anything out of the ordinary, so here’s a larger example. …Just by increasing the last number by 1:
We can also then use even larger second level chains to get even larger numbers — numbers so large that the can’t be expressed with regular Conway arrows.
etc.
But Wait! There’s More!
We can then make even larger levels.
and
or just a formula for any level:
Next On Numbers!
Next: Limit Functions
Heh, nice to see someone also taking a look at extending Conway chains. A while ago, Tricky and myself attempted to create our own takes on chaining. While his embedded (powerfully) conway chains in a funky new chain, I took a completely different approach to making veeeery big chains, possibly worth a look: http://echochamber.me/viewtopic.php?f=14&t=7469&sid=e36cf4ebbc8553053fec008b3fb25550&start=200#p1252045
But, in summary (for the *reduced* version which still pawns the extended conway chains tricky-style :P ):
a/b = a^b [used to be a->a->(b^a) or something]
a/b/c = a/(a/(a/ … (b/c)))) ; b/c times
a/b/c/d = a/b/(a/b/(a/b/ … (b/c/d))) ; b/c/d times
… and so on
then a//b = a/(a/(a/ .. (a/b))) ; a/b times {Special case: a//b = a/a/b}
a///b = a//(a//(a//…(a//b))) ; a//b times
and so on
with a/b//c = a/(a/ .. (b/c)); a/b/c times
I mean, 2/3/2 = 2/(2/(2/(2/(2/(2/(2/(2/(3/2)))))))) >> 2|^|^10
while 2/2/3/2 = 2/2/(2/2/ …(2/3/2) ) ; 2/3/2 times … sheesh. Then every term needs to be re-evaluated, the first collapse being 2/2/(2/3/2) = 2/2/((2|^|^9)^3) and so on
What about Moser polygons,considered the step beyond Conway arrows at Susan Stepney’s site?…I’d like to see a good comparison between 3->3->3->3 and
3[3[3[3]]]] (i.e. 3[3[27]]])…both are way bigger than Moser’s Number but are they both bigger than Graham’s?
What is the link to Susan Stepney’s site?
The Steinhaus-Moser notation in its original form at http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Moser_notation generates numbers much smaller than what you can do with even simple non-extended Conway arrows.
3->3->3->3 is much bigger than a 3 in four triangles.
My linked website has a link to Susan Stepney’s.
You are misinterpreting her notation for Moser polygons…3[3[3[3]]] is NOT a 3 in 4 triangles…it is 3 in a 3-in-a-27-sided-polygon-sided-polygon!
You haven’t responded to my correction,but further examination of Tim Chow’s proof indicates that 3[3[3[3]]] is less than 3->3->(3->3->49)->1 So it’s actually still less than Graham’s Number.
4[4[4[4]]] is less than 4->4->(4->4->(2(((256^256)^(256^256))^((256^256)^(256^256))-2)-1)->1 but I’m not sure how that chain would simplify!
I’ll make a post for you within a few days or so. I’ve been focused on projects besides blogging recently.
I’ll make a post about it sometime before the end of the month. :/
I thought you meant July…
….will it be August?