User blog comment:MilkyWay90/Not-Registered Users, tell your Googology ideas in the comments/@comment-2601:142:2:EC49:247C:A73D:AD4A:5ED9-20180803125948

Thanks for making this idea a reality! I owe you one. ;) So this idea is pprreettyy strong I'd say, but i'm a MILLION percent sure some function somewhere makes this look like addition.

So it works like so:

<0,n> = fn(fn-1(fn-2(...f2(f1(f0(n)))))) ~ fw(n).

Milestones: <0,4> is larger than tritri and the mega and <0,5> is larger than the grahal. <0,<0,4>> is larger than the Moser and <0,<0,5>> is larger than the graham grahal.

<1,n> = fw+n(fw+(n-1)(fw+(n-2)(...(fw+2(fw+1(fw(n))))))) ~ fw2(n)

Milestones: <1,1> is larger than g_8 where g_64 is Graham's number, but <1,2> on the other hand, DWARFS Graham's number. <1,3> is larger than the Hypergraham and Conway's Tetratet.

<2,n> = fwn(fw(n-1)(fw(n-2)(...(fw2(fw(n)))))) ~ fw^2(n)

Milestones: <2,n> is comparable to cg(n), WHICH MAKES IT PRETTY STRONG.

<3,n> = fw^n(fw^(n-1)(fw^(n-2)(...(fw^2(fw(n)))))))) ~ fw^w(n)

Milestones: idk, but it's BIG.

You can see how you can continue this forever, how <4,n> would be around fEo(n), and how you could get up to the Feferman–Schütte_ordinal with just . I'd say other ideas I have, but they're all either weaker than this or the same strength.