User blog comment:IAmNotATRex/My Extension to the Fast Growing Hierarchy/@comment-35870936-20180820052650

\(F0_n(x) = f_n(x)\) in the fast growing hierarchy

\(F1_0(x) = F0_{F0_{...}(x)}(x)\) with x repetitions. \(F1_0(x)\) is equivalent to \(f_{\omega+1}\) in the fast growing hierarchy.

\(F1_1(x) = F0_{F0_{....F0_1(x)}(x)}(x)\) with x repetitions. This is also only equivalent to \(f_{\omega+1}\). I think that this rule is broken. I think that this rule would work better:

\(Fn_a(x) = Fn_{a-1}(Fn_{a-1}(Fn_{a-1}(...Fn_{a-1}(x)...)))\), with x repetitions.

Using this rule, your notation has a power of \(\omega^2\) in the FGH.