User blog comment:Mush9/MUSH/@comment-27516045-20161008171408/@comment-30118230-20161012170841

Define a system Y(n),

now define the fast-growing hierarchy with all it's rules like f_a(n)=f_a-1(f_a-1(....(n)...),but this time f_0(n)=FOOT(n) instead of n+1.

Y(n)=f_Takeuti-Feferman-Buchholz ordinal(n)

Now,define Y^2(n)=The smallest number that cannot be described whithin the languige of second order arithmetic whith Y(n) symbols or less

NOW define the number SUPERSALAD as the following:

Y^{Y(Utter Oblivion)}(Utter Oblivion)=©1

Y@Y(n)=Y(n)^^{Y(Y(n))}(n)

Y,Y,Y(n)=Y@(Y@Y)(n)

©2=Y,Y,Y,Y....Y,Y,Y(©1),where ...=©1

©n=Y,Y..©n-1..Y,Y,Y,Y(©n-1)

Main output:

©(©(©(©(©(...(©(©(©(©(3)))...))) with ©(©1) ©'s=©^2

SUPERSALAD=©^©(©1)