claim
In his 1936 paper, Alan Turing proved that a program capable of solving the halting problem for all possible input programs—while being guaranteed to halt itself—is a logical impossibility.

Authors

Sources

Referenced by nodes (1)