User blog:Ubersketch/A better Fast Growing Hierarchy: The Uber Hierarchy

1. f(a){[1]b} = f(f(... where the function is applied b times to a.

2. f(a){[b]c} = f(a){[b-1]a[b-1]a...} where there are c as.

3. f(a){[b]c[d]e...} is evaluated like so: f(a){[b]c} = f(a) in f(a){[d]e} = f(a) in... until it is fully evaluated.

4. f(a){[b]c} = f(a){[ath member of the fundamental sequence of b]c} iff b is a limit ordinal

Simple as pie, formal, yet as powerful as the FGH. Despite all of this I'm still dissatisfied with this function for one reason: I feel that using limit ordinals like the FGH is kind of a naive extension. I have plans to use mensor separators but other than that it feels a bit empty. Lots of other notations have more interesting separators while this just has ordinals. Or I'm wrong and the limit ordinals basically encompass every seperator ever.