User blog comment:P進大好きbot/Googological Open Problems on OCFs/@comment-25337554-20190528082117

>Actually, there are many googologists who tried to formalise UNOCF as an OCF, an ordinal notation, or a notation system with a recursive system of fundamental sequences, but the mission has not been completed. As far as I know, the most successful trial is given by Nayuta Ito here. It formalises UNOCF up to ψ0(Ωω) with respect to Buchholz's OCF.

That's really misleading. It looks like NIECF were well-defined OCF (at least I read so), which is a very false statement.