User blog comment:KthulhuHimself/Terminal array notation./@comment-25601061-20151026015054/@comment-26428969-20151027075501

recursion? RECURSION??? you have NO IDEA what [] bracket makes! FOST is already strong enough to make recursion unimaginably stronger than TaN etc

what has the omega-one-chess do with this? FOST can already define it without any problem! same for collapsing functions! do you have any idea of the strength of FOST???