User blog comment:Ubersketch/A proposal for a standard/@comment-34422464-20190813205023/@comment-35470197-20190813233753

If you do not have an explicit algorithm, why could you state that it is better than the other candidate? Please do not state a proposal before you understand it or get an evidence.

Moreover, your sentences include so many mistakes. It is really hard for others to precisely point out all the errors to you, who are not studying from your errors and not learn stuffs before you use them. Do you remember that you asked how to encode the order into an algorithm? Did you study it? I am certain that you did not from your sentences.
 * Uncountable ordinals are not recursive ordinals.
 * A notation corresponding to a subset of recursive ordinals does not necessarily admit a recursive well-ordering compatible with the structure.
 * If you do not have an alogorithm to computa FSes, then it is useless in analysis.

> where is

If you could not understand the comparison algorithms for CNF, then you are not ready for studying OCFs or higher ordinal notations. It is a good opportunity to learn them. Could you study it by yourself? Asking others is good, but you need to consider by yourself, because you learn few from answers. I know that it is unpleasannt for you, but I strongly recommend you to honestly study mathematics before you cast so many incorrect statements to the world, which will ruin beginners.