User blog comment:Wythagoras/My Turing machines/@comment-6768393-20131012123348/@comment-5150073-20131013141545

I've heard that some tricky ways have been invented for proving whether TM is halting or not. These things helped Skelet to create a program which proves the value of BB(4) and almost all TMs for BB(5). If even BB(n) is an uncomputable funtion itself, each term of it is a computable number. So there will be an algorithm for evaluating BB(30) too. The quantum computer is good because we can immediately weed out small TMs and fight with the hardest ones.