In their new paper, the five computer scientists prove that interrogating entangled provers makes it possible to verify answers to unsolvable problems, including the halting problem.
If you actually read the article, it doesn’t say anything about being able to solve the halting problem. It used the undecidability of the halting problem to prove equivalence of another class of problems to the halting problem.
Which is why I said it was still a “never say never” and not an already solved problem.
The halting problem is impossible for Turing machines, but if hypercomputation ends up possible, it isn’t impossible.
For example, an oracle machine as proposed by Turing, or a ‘real’ computer using actual real values.
The latter in particular may even end up a thing in the not too distant future assuming neural networks continue to move into photonics in such a way that networks run while internals are never directly measured. In that case the issue would be verifying the result - the very topic of the paper in question.
Effectively, while it is proven that we can never be able to directly measure a solution to the halting problem, I wouldn’t take a bet that within my lifetime we won’t have ended up being able to indirectly measure a solution to the problem and directly validate the result.
An exact 1:1 realtime copy of itself emulated within a simulated universe.
Pretty much everything else mentioned in this thread falls into the “never say never” category.
Also being able to analyze any program and guarantee it will stop
Probably still a never say never problem:
If you actually read the article, it doesn’t say anything about being able to solve the halting problem. It used the undecidability of the halting problem to prove equivalence of another class of problems to the halting problem.
Which is why I said it was still a “never say never” and not an already solved problem.
The halting problem is impossible for Turing machines, but if hypercomputation ends up possible, it isn’t impossible.
For example, an oracle machine as proposed by Turing, or a ‘real’ computer using actual real values.
The latter in particular may even end up a thing in the not too distant future assuming neural networks continue to move into photonics in such a way that networks run while internals are never directly measured. In that case the issue would be verifying the result - the very topic of the paper in question.
Effectively, while it is proven that we can never be able to directly measure a solution to the halting problem, I wouldn’t take a bet that within my lifetime we won’t have ended up being able to indirectly measure a solution to the problem and directly validate the result.