User blog comment:Tetramur/Pentational arrays and beyond - comparisons/@comment-37993808-20191212125402

"of order at least \(\omega_1^\text{CK}\)  in FGH"

... under assuption of that there is the enumeration of Turing machines for which \(\omega_1^\text{CK}\) is approximated to the busy beaver function.

I know that BEAF is a computable function at any definition. But the lack of a work above SVO under climbing method makes me to look for some other (maybe weaker) definitions.