User blog comment:KthulhuHimself/Terminal array notation./@comment-25601061-20151018204449/@comment-27014275-20151019065220

First, I'm working at this very moment on a universal ruleset.

Second, Any sub-omega function will do. For the sake of the point, choose plexation, factorial, or the fibonacci sequence for f(n).

<0<0,1>1> would be equal to omega^(omega^omega), and I calculated it. Anything above that is not yet in my field of knowledge wherever or not they are considerably faster growing than <0<0,1>1>.