Bitetrommthet

Bitetrommthet is equal to \(f_{\theta(\Omega^\Omega)}(10)\)My system of number names (FGS) - Traveling To The Infinity with respect to the fast-growing hierarchy and Feferman's \(\theta\)-function with fundamental sequences using equalities to outputs of Buchholz's function. It equal to \(f_\textrm{LVO}(10)\), where LVO denotes the large Veblen ordinal. The term was coined by wiki user Denis Maksudov.
It is equal to \(f_{\psi_0(\Omega^{\Omega^\Omega})}(10)\) using Buchholz's function.
== Etymology ==
The 4 parts of the name, "bi", "tetr", "omm" and "thet", mean 2, tetration, \(\Omega\) and \(\theta\) function respectively, which form \(\theta(\Omega\uparrow\uparrow2)=\theta(\Omega^\Omega)\) when concatenated backwards. So the full name indicates the ordinal index of the FGH.
==Computability==
The computability of a number defined using FGH is non-trivial, because the computability requires an ordinal notation to be defined. Googology Wiki user C7X has created a JavaScript program demonstrating the computability of Buchholz's ordinal notationC7X, "Drafts". However, there are some modifications to the ordinal notation at and beyond \(\psi_0(\psi_2(0))\) with respect to Buchholz's original notation, but none of these modifications happen at the scale of this googolism.
== Approximations ==
Notation 	Approximation
Bird's array notation 	\(\{10,10 [1 [1 \backslash 1 \backslash 2 \neg 2] 2] 2\}\)
Hardy hierarchy (using Buchholz hierarchy) 	\(H_{\psi_0(\Omega^{\Omega^{\Omega}})}(10)\)
Slow-growing hierarchy (using Buchholz hierarchy)	\(g_{\psi_0(\Omega_2^{\Omega_2^{\Omega_2}})}(10)\)
== Sources ==
Category:Numbers
Category:Numbers by Denis Maksudov
Category:10-based FGH numbers
Category:Bachmann's collapsing level