User blog comment:Ubersketch/Hypernomial Hierarchy v3/@comment-36957202-20190617184623/@comment-34422464-20190619203153

My idea was to make ordinals but without fixed point traps that plague a lot of notations. So I decided to try and find a way to enumerate true recursive functions (being functions made entirely of repetition on successorship and zero function) and to reach the CK ordinal. Unfortunately, I have not managed to reach CK yet as I can't think of any non-terminating cases that aren't completely obvious.