Just curious about this article I read today in the Google News. I am not a mathematician but enjoy the history of mathematics and the article seems to suggest the Halting problem has been disproven. I always thought once a theorem is proven it would never be disproven but again I am not an expert.
The article is the following: https://gizmodo.com/remarkable-mathematical-proof-describes-how-to-solve-se-1841003769
I do not know what the rules are for allowing me to enter a link so maybe I will write the part of the article in quotes to illustrate the point as follows:
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.
The 150-page proof, titled simply “MIP*=RE,” deals in the esoteric subject of computational complexity. If it holds under scrutiny, it demonstrates a profound connection between quantum physics, computation, and mathematics. It shows that a theoretical class of computing devices—a verifier interrogating the quantum-entangled oracles—can check some of the most complex computer problems imaginable.
The last paragraph is beyond my understanding with the level of math that I have but what disturbes me is that I always believed once a proof was shown to be true it could not be disproven. The halting problem is related to Godel's incompeteness theorem and I know Godel's Theorem has also been proven to be true.
I thought perhaps someone who is expert could comment on this. Thank you.