User blog comment:Wythagoras/My Turing machines/@comment-6768393-20131012123348/@comment-1605058-20131013072238

Ikosarakt, you are probably right, but busy beaver search for n>6 will always be (in my opinion) just looking for better machine, which might be far far from actual value. I don't think we will ever find out machine which gets even close to BB(30).

Wythagoras, I'm really sceptic whenever anyone talks about SOA ordinal. I won't agree, unless you present me formal proof. Also, only way I can think of to exceed Loader's number is C interpreter Turing machine.