User blog comment:Wythagoras/My Turing machines/@comment-6768393-20131012123348/@comment-5529393-20131013122523

Ikosarakt1, in what way will quantum computers help us to find Busy Beaver numbers? Note that quantum computers are not universally powerful; there is a certain class of problems (quite a limited class so far) in which quantum computers can solve the problems faster than classical computers. But, for example, it is not expected that quantum computers can solve NP-complete problems any faster than classical computers. At any rate, there is no algorithm that can solve the Halting Problem, so at best we can have computers look for certain halting behaviors, and analyze the remaining Turing machines independently. It's possible that certain halting problems could be detected by quantum computers but not by classical computers, but I am very skeptical of that.