User blog comment:Kyodaisuu/My ordinal is bigger!/@comment-1605058-20140921061552

Let R[n] be largest computable ordinal definable in FOST using at most n^^n symbols. Let F(n)=f_R[n^^^n](n^n) in FGH. My entry is F(Rayo(F(Rayo(googolduplex)))).