User blog comment:Scorcher007/The whole googology in one diagram/@comment-11227630-20180323134709/@comment-31580368-20180325023044

This means ... If I understand correctly, higher-order languages allow us to create stronger computable and uncomputable functions. But un computable functions are always stronger than computable. E.g. some  computable functions was level  ZFC+huge -  this is the most, from what we know, what you can create in FOST. Some  computable functions was level  MK+huge will be stronger. But Rayo's uncomputable FOST(n) and SOST(n) will be stronger than both. I have depicted computable and un computable ones on top of each other to show that un computable functions begin their growth slowly and can first return numbers less than computable.