User blog comment:DWither/Doubt about busy beaver/@comment-30869823-20180904192714/@comment-30869823-20180905220035

Using BB(n) you can determine if any program halts by running a program of length n BB(3n+6) steps and see if it halts in that time, if it doens't it won't halt at all. I didn't closely examin your algoritm to search for a small flaw you could probabely fix but instead gave the proof that there must be a flaw.