User:Cloudy176/Croutonillion

Croutonillion is a groundbreakingly pointless googologism, the mother of all salad numbers. It is currently under construction. Please edit this page and add to it!

I'm pretty sure we've beaten gigoombaverse. Gigoombaverse is a terrible googologism; croutonillion is not only bigger, but it's even worse!

Definition
"X" refers to the result of the previous operation. Start with googoltriplex.


 * 1) X^^^...^^^X (X copies of ^)
 * 2) BB(X)
 * 3) megafuga(booga(X))
 * 4) X-xennaplex
 * {X, X / 2}
 * 1) (Rayo's number)^X
 * 2) BB(X) (repeat this step Y times, where Y is the value of Clarkkkkson on January 1, googolgong CE)
 * 3) \(f_{\Gamma_0}(X)\)
 * 4) giggol-X-plex
 * 5) X!!!...!!! (nested factorials, meameamealokkapoowa oompa times)
 * 6) gongulus-(2X + 1)-plex
 * 7) TREE(TREE(TREE(...TREE(X)...))) (X nested functions)
 * 8) floor(X^pi)
 * {X, X | 2}
 * 1) Ξ_2(X), the Xi function with X oracle combinators and argument X. Do this step Y times, where Y is computed with the following steps:
 * 2) Set Y = 3.
 * 3) Y^^^...^^^(Y + 2) (Y copies of ^)
 * 4) alpha(Y) in FGH, where alpha is Goucher's ordinal
 * 5) T(Y) (Torian)
 * 6) Circle(Y) (Steinhaus-Moser notation). Do this googol times.
 * 7) E10#^#^...^#^#10 (with X copies of #)
 * Let f(x) be the result when going through all the steps up to here. Go in reverse order, and start with x.
 * 1) f(TREE(X))th apocalyptic number
 * 2) f^(goober bunch)(x)
 * 3) X@X@X@X@X@X@X (legiattic array of)
 * 4) X^^^^^X
 * 5) X^^^^^^X
 * 6) X^^^^^^^X
 * 7) X^^^^^^^^X
 * 8) f(x)^^^...^^^f(x) (f(x) copies of ^)
 * 9) SCG(TREE(SCG(TREE(SCG(f(x) + tritri) + supertet) + superpent) + superhex) + supersept) + Moser
 * 10) Exploding Tree Function(X)
 * 11) Rayo(X), 13 times
 * Create an alternate version of croutonillion by stopping here (do the 103X + 3). Call this alternate C.
 * 1) Sigma_X(C)
 * 2) X^^^^^^^^^^^^^X
 * 3) XvvvvvvvvvvvvvX (down arrows)
 * 4) X -> X -> X -> X -> X (chained arrows)
 * {X, X (1) 2}
 * 1) X$ (Pickover's superfactorial)
 * 2) gag-X
 * 3) X^super gongulus
 * 4) {X & L}10,10
 * X!
 * 1) H(H(...(X)...)) (X nested functions), repeat grangoldex times.
 * 2) Same as step 15.
 * 3) {10,100 //...// 2} (X /'s)
 * 4) Repeat 142857^1337 times for step 1 to step 40.
 * 5) X^^...^^(10^1337) (meameamealokkapoowa oompa ^'s)
 * 6) {googolplexian,X,X}
 * 7) greagol-X-threx, then gigangol-X-tetrex, then gorgegol-X-pentex, and so on googol times
 * 8) E100#100...100#100#X+1 (googol 100's)
 * 9) X-illion
 * 10) X&&...&&X (X &'s)
 * 11) E100#^#X
 * 12) googolplexian^googolplexian^X
 * 13) Y^X, where Y is lynz at May 1 meameamealokkapoowa-arrowa A.D.
 * 14) terrible tethrathoth-ex-terrible tethrathoth-...-ex-terrible tethrathoth (X terrible tethrathoth's)
 * 15) Rayo(Rayo(X) + 3)
 * 16) Ackermann(X, X)
 * 17) BH(X) starting with a size-X chain of \(\Gamma_0\)s
 * 18) Circle(Circle(X)) (Friedman's circle theorem, not SMN)
 * 19) Length of the Goodstein sequence starting with X
 * 20) X-illion-illion-illion-...-illion-illion-illion, faxul times
 * 21) BOX_M~^X^X
 * 22) X^(Xth digit of pi + 1)
 * 23) Arx(X,X,X,...,X,X,X) (with X X's)
 * 24) \(f_{X}(X)\), repeat X times
 * 25) G(X)
 * 26) E(Y)Y#^^...^^#^#Y (X ^'s), where Y is googolplex.
 * 27) Repeat X times for step 1 to step 63.
 * 28) Repeat X times for step 1 to step 64.
 * 29) Repeat X times for step 1 to step 65.
 * 30) Repeat X times for step 1 to step 66.
 * 31) Repeat X times for step 1 to step 67.
 * 32) Repeat X times for step 1 to step 68.
 * 33) Repeat X times for step 1 to step 69.
 * 34) Repeat X times for step 1 to step 70.
 * 35) 10^^X
 * 36) X^^10
 * 37) X^^X
 * 38) {L & L & L...L & L & L,X}X,X (X L's)
 * 39) 75*75...75*75*X (X 75's)
 * 40) Graham's Number*X*Y, where Y is Step 5.
 * 41) Rayo(X)
 * 42) SCG(SCG(SCG(SCG(X)+googol)+googolplex)+googolplexian)
 * 43) TREE(TREE(TREE(TREE(X)+googol)+googolplex)+googolplexian)
 * 44) Rayo(Rayo(Rayo(Rayo(X)+googol)+googolplex)+googolplexian)
 * 45) Ξ(Ξ(Ξ(Ξ(X)+googol)+googolplex)+googolplexian)
 * 46) Arx(Arx(Arx(Arx(X)+googol)+googolplex)+googolplexian)
 * 47) BH(X) expect for hydra using TFB labels instead of omegas
 * 48) Repeat steps 1-84 until number of repetitions gets OVER 9000 (i.e. 9001 times)
 * 49) Repeat X times for step 85.
 * 50) Repeat X times for step 86.
 * 51) Repeat X times for step 87.
 * 52) Repeat X times for step 88.
 * {X,X (X) X,X}
 * {X,X,X} & X
 * 1) 1000^X^N, where N is \(SCG^{N2}(X)\), where N2 is \(SCG^{N3}(X)\), where N3 is \(SCG^{N4}(X)\), where N4 is \(SCG^{N5}(X)\), where N5 is \(SCG^X(X)\).
 * 2) E100#^#^#X
 * 3) E100#^^#^#X
 * 4) E100#^^^#^#X
 * 5) E100#^^^^^^^^^^^^^^^^#^#X + X
 * 6) E100#^^^^^#^#X
 * 7) E100#^^^^^^#^#X
 * 8) E100#^^^^^^^#^#X
 * 9) X^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^X
 * 10) Arx(X,X,X,X)
 * 11) Arx(X,X,X,X,X)
 * 12) 1337133713371337...1337133713371337 (X 1337's)
 * 13) X+1
 * 14) X&&&...&&&X, with X copies of &
 * 15) H(X), Chris Bird's H function
 * 16) H(X), hyperfactorial
 * 17) m1(X), fusible margin function
 * 18) SCG^X(X)
 * 19) X -> X -> X -> X -> X
 * 20) cg(X)
 * 21) C(X), Hurford's C function
 * 22) Xi(X)
 * 23) X!!!!! (nested factorial, not multi) or X!5 = ((((X!)!)!)!)!
 * 24) First Mersenne prime after X
 * 25) X^X^X^X^X
 * 26) {10, 100, 1, 3, 3, 7, X}
 * 27) {10, 100 (1337) X}
 * 28) TREE^X(X) (repeat this step humongulus times)
 * 29) Rayo(X) (repeat this step humongulus + 1 times)
 * 30) A(X, X) (Ackermann function; repeat this step humongulus + 2 times)
 * 31) X^^^X (repeat this step humongulus + 3 times)
 * 32) giggol-X-plex
 * Create an alternate version of croutonillion by stopping here. Call this number C2.
 * 1) SCG(SCG(C2 + X) + X) + X^C2
 * 2) C*C2*X
 * 3) X!X, Nested Factorial Notation.
 * 4) X^^^C
 * {X,1337,100}
 * 1) {9001,9001,C,X}
 * GX
 * 1) Graham's Number^^^...^^^X (C ^'s)
 * 2) goo-X-ol
 * 3) X-oogol
 * 4) X^^^^^^^^^^^^^^^^^^^^^^^^^^^X
 * 5) 103(X+1), repeat 1000000 times.
 * 6) 2^(First prime after log2(X))
 * 7) X-ty-Xs (X copies of X concatenated)
 * 8) X$ (superfactorial; repeat 50 times)
 * 9) Rayo(X)
 * 10) X!X[X] in hyperfactorial array notation

Croutonillion is.

Guidelines

 * Be creative. Repeat steps, go back and loop.
 * Avoid FGH for non-recursive ordinals. It can grow pretty slowly at first.
 * Explain any notation that may be unclear.
 * Define everything (e.g. "Rayo's function with X-th order logic" -- what's Xth order logic?).