User blog comment:Kyodaisuu/My ordinal is bigger!/@comment-5529393-20140921142331

Out of curiosity, how would R(n) = "the largest computable ordinal expressible in n characters in FOST" compare to w_1^CK [Rayo(n)]? It looks like R(n) grows at least as fast as w_1^CK[Rayo(n)], is the reverse clearly true?