SoylentNews is people
SoylentNews
'Remarkable' Mathematical Proof Describes How to Solve Seemingly Impossible Computing Problem:
You enter a cave. At the end of a dark corridor, you encounter a pair of sealed chambers. Inside each chamber is an all-knowing wizard. The prophecy says that with these oracles' help, you can learn the answers to unanswerable problems. But there's a catch: The oracles don't always tell the truth. And though they cannot communicate with each other, their seemingly random responses to your questions are actually connected by the very fabric of the universe. To get the answer you seek, you must first devise... the questions.
Computer scientists are buzzing about a new mathematical proof that proposes a quantum-entangled system sort of like the one described above. It seems to disprove a 44-year-old conjecture and details a theoretical machine capable of solving the famous halting problem, which says a computer cannot determine whether it will ever be able to solve a problem it's currently trying to solve.
(Score: 2) by FatPhil on Tuesday January 21 2020, @08:43AM
Solving the halting problem wasn't a surprising outcome given that it was hard coded as one (nay, two) of the components of the system.
Great minds discuss ideas; average minds discuss events; small minds discuss people; the smallest discuss themselves