User blog comment:Ubersketch/A proposal for a standard/@comment-35470197-20190811012241/@comment-35470197-20190812090002

> proof

Although I have not written the proof, I think that the FS is correct. (Actually, it was wrong, but I corrected it by changing the defintiion of the notion of standard forms.)

> problem

In order to use a notation associated to an OCF in an analysis in computable googology, it should admit a structure of an ordinal notation so that the FS is computable.

In the definition of the FS (in set theory), we use \(\in\) relation, which is not computable (in arithmetic) if we deal with any ordinals. You do not regard it as a problem, but less sophisticted googologists will not understand how to encode \(\in\) relation between ordinals into a computable relation between expressions of standard form. At least, I think that it is not trivial for the majority here to determine whether Ω_a < ψ_b(c) or not for given ordinals a,b, and c below the least Omega fixed point.