User blog comment:Swooped me in one hit/megagoolagon/@comment-29310326-20170213200309/@comment-30754445-20170213202933

Yeah, in the general "big numbers" game, uncomputable functions are okay.

But to use them to beat loader's number is kinda pointless. Writing BB(x+1) where x is the number of states in the Turing Machine that calculates loader's number just isn't that interesting.

Fair point about Friedman's work, though.