It’s really a mathematics problem. At one the turn of the 20th Century, there was a famous list of outstanding questions in mathematics. Hilbert wanted to know if mathematics was complete — did all true statements have proofs. Kurt Godel disproved that by constructing a self-referential statement which claimed it had no proof. If it was true it has no proff. If it was false, it did have a proof. Mathematics was wither incomplete or inconsistant.
The fall back question was could we find all true proofs. Alan Turing imagines a machine that could solve problems — a Turing machine. He described how it worked and designed a program that tried to prove statements. He showed that, given an arbitrary statements, there was no way of knowing if the program would ever find a solution. This is the Halting Problem.
Latest Answers