Gossablossla

Gossablossla is equal to \(\{10,10 (1) 100\}\ \&\ 10\) using the array of operator and BEAF. It has gossol entries. The term was coined by Cookie Fonster.
==Approximations==
Since it is not defined by now, the following approximations are just expected values:
Notation 	Approximation
Fast-growing hierarchy (using this system
of fundamental sequences)	\(f_{\psi_0(\Omega^{\Omega^\Omega\omega})}(100)\)
Slow-growing hierarchy	\(g_{\psi_0(\Omega_2^{\Omega_2^{\Omega_2}\omega})}(100)\)
== Sources ==
== See also ==
Category:Numbers
Category:Higher array notation
Category:BEAF
Category:Numbers by Cookie Fonster
Category:Bachmann's collapsing level
Category:Unformalised