2 ms·
> but what I find most surprising is the claim that this would make the halting problem solvable. I don't think this is correct. I believe that it only makes t
by naasking 7y ago
> but what I find most surprising is the claim that this would make the halting problem solvable.
I don't think this is correct. I believe that it only makes the Halting Problem verifiable to a simple verifier dealing with two entangled verifiers. So a verifier typically has to rely on an oracle to solve the Halting Problem, but this new proof eliminates the need for that trust by a verification procedure using two entangled oracles.