4 ms·
making the halting problem solvable if you have quantum entangled oracles that know everything. Welcome to complexity theory :) Reminds me of the proof that tim
by hansdieter1337 7y ago
making the halting problem solvable if you have quantum entangled oracles that know everything. Welcome to complexity theory :)
Reminds me of the proof that time traveling turing machines can solve the halting problem.
- sterlind 7y agoare those the Turing machines which can send an unlimited number of qubits back through a closed timelike curve? that result was mind-blowing. It only required classical computers, however, at least in the formulation I saw. Reversible computing in general seems weird when it comes to time.