'Remarkable' Mathematical Proof Describes How to Solve Seemingly Impossible Computing Problem

It 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.

from gizmodo http://www.gizmodo.co.uk/2020/01/remarkable-mathematical-proof-describes-how-to-solve-seemingly-impossible-computing-problem/