ConwayLife.com

is everyone ok if we just skip to g2 = 3{3{4}3}3 (i.e. 3^^^...^^^3 with g1 = 3^^^^3 arrows)?

Is G_(G_1) too much?

(If so, how about G_5?)

Is H_w^(w+1)(64) too much?

*shrugs* whatever you folks want (though if G_G_1 then H_w^(w+1)(64) is too small, also H is "above" arrows imo)

is googolplex too big of a jump?
//i dont know this sort of stuff,im still in middle school

the lifestroyer wrote: December 8th, 2020, 12:25 am is googolplex too big of a jump?
//i dont know this sort of stuff,im still in middle school

I believe we're way past googolplex

Hunting wrote: December 8th, 2020, 12:42 am

the lifestroyer wrote: December 8th, 2020, 12:25 am is googolplex too big of a jump?
//i dont know this sort of stuff,im still in middle school

I believe we're way past googolplex

indeed, googolplex is 10^10^100 < 2^^6

the lifestroyer wrote: December 8th, 2020, 12:25 am //i dont know this sort of stuff,im still in middle school

the forums is like average age 12

I'm 12yo as well

I doubt the forum average age is 12 (particularly if you count inactive accounts too), there aren't many people below that age and plenty of adults


anyway let's have the current number be G5; I'll say G10

Moosey wrote: December 8th, 2020, 5:31 pm I doubt the forum average age is 12 (particularly if you count inactive accounts too), there aren't many people below that age and plenty of adults


anyway let's have the current number be G5; I'll say G10

What does G mean

the sum of all previous numbers on this thread

MathAndCode wrote: December 10th, 2020, 11:28 pm the sum of all previous numbers on this thread

Too slow imo technically cheesing too

Hunting wrote: December 8th, 2020, 11:10 pm

Moosey wrote: December 8th, 2020, 5:31 pm I doubt the forum average age is 12 (particularly if you count inactive accounts too), there aren't many people below that age and plenty of adults


anyway let's have the current number be G5; I'll say G10

What does G mean

the function that constructs graham's number: G1 = 3^^^^3, G(n+1) = 3{Gn arrows}3

Moosey wrote: December 11th, 2020, 10:00 am

MathAndCode wrote: December 10th, 2020, 11:28 pm the sum of all previous numbers on this thread

Too slow imo technically cheesing too

Hunting wrote: December 8th, 2020, 11:10 pm

Moosey wrote: December 8th, 2020, 5:31 pm I doubt the forum average age is 12 (particularly if you count inactive accounts too), there aren't many people below that age and plenty of adults


anyway let's have the current number be G5; I'll say G10

What does G mean

the function that constructs graham's number: G1 = 3^^^^3, G(n+1) = 3{Gn arrows}3

Dang that's my function so my function is a rediscovery ahhhh

So how do I go forward? Extending the graham's number is obviously trivial, so the only way to make it "interesting" is to build a meta-Graham function. That means the game should go on like meta-G, meta-meta-G, meta-meta-meta-G, which is trivial again.

If we're continuing off of G_(G_1), then how about H_w^(w+1)(H_w^(w+1)(2))

PkmnQ wrote: December 12th, 2020, 6:33 am If we're continuing off of G_(G_1), then how about H_w^(w+1)(H_w^(w+1)(2))

Hardy hierarchy violates the rules because it qualifies at past up-arrows*
*for subscripts larger than w^w
Then again Graham's sequence could be considered rule-violating (though it's basically just iterated graham so)

the maximum number of steps that a Turing machine with TREE(3) states that eventually halts can make before halting

MathAndCode wrote: December 12th, 2020, 10:52 pm the maximum number of steps that a Turing machine with TREE(3) states that eventually halts can make before halting

Can you please stop being "clever" and keep messing up the game? This is another place I find you annoying.

MathAndCode wrote: December 12th, 2020, 10:52 pm the maximum number of steps that a Turing machine with TREE(3) states that eventually halts can make before halting

FF(TREE(3)) is a bit (read: a lot) too much of a jump. Also it uses FF and TREE, both of which are past up-arrows

Anyway how about 3{3,3,2} in SeN (at this point SeN is approximately beaf)

bump
3{3,4,2}

RAYO(RAYO(RAYO(RAYO(TREE(TREE(3))))))

Fishhook and tempoary paperclip

Aleph null
I'm kidding, is busy beaver too much of a jump?

HotWheels9232 wrote: May 29th, 2022, 5:53 pm RAYO(RAYO(RAYO(RAYO(TREE(TREE(3))))))

This uses an uncomputable function and is also too much of a jump, btw.

(And apparently one of the other rules was not using notations that aren't your own past H_w^w(n) level)

hotcrystal0 wrote: May 30th, 2022, 8:52 am Fishhook and tempoary paperclip

Code: Select all

snip

this would be less than hotwheels' number. Also, it's not wholly clear what you're using RAYO as -- rayo's number?? (You appear to be using it as a number.)

Sarah wrote: June 1st, 2022, 8:10 am Aleph null
I'm kidding, is busy beaver too much of a jump?

BB is an uncomputable function, so by the rules set in the first post, it can't be used. It's also not as strong as rayo so at this point it wouldn't add much size to the numbers.



I have no memory of what SeN was, so we can start over ig. It looks like it was something like chained arrows so 3{3,4,2} is probably on par with g4 or so and as such I probably went backwards.

I guess if people are still interested in this thread we can start over?

Ok then. The first number is 0.