User blog comment:KthulhuHimself/Terminal array notation./@comment-25601061-20151026015054/@comment-27014275-20151026191508

Q(n) fields are a work in progress, and will most likely be stronger than nearly all the other computable functions to date, excluding loader.c.

Well, from what I could understand in the definition of FOOT(n), it seems to simply augument "oodinals", ], and [ into FOST, which somehow makes it a whole lot stronger.

Don't get me wrong, its not that I think that a more complex function will mean a larger number or something, its just that allowing FOST to refer to any type of recursion (even self-contained!), and then use those new terms in a new "First-order-norminal-theory", or FONT, to create even larger expressions, (all while allowing itself to define even more terms), seems a bit stronger.