User blog comment:MilkyWay90/Not-Registered Users, tell your Googology ideas in the comments/@comment-2601:142:2:EC49:247C:A73D:AD4A:5ED9-20180803125948/@comment-31966679-20180806105308

PsiCubed2, if you identify the pattern in this, you can make a rule:

 = \(f_{lvl(x, \omega, y)}(f_{lvl(x, \omega, y - 1)}(\ldots f_{lvl(x, \omega, 1)}(f_{\omega}(n)) \ldots))\) for x > 0, and he/she already defined <0, y>

Because of this,  would be approximately \(f_{lvl(n, \omega, n)}(n)\)

I made a proof on vacation that the limit of lvl(n, \omega, n) would be \(\zeta_{0}\), because I was bored and only had a notebook and a pencil.

So your function reaches \(f_{zeta_{0}}(n)\)!