The Halting problem is a fundamental concept in computability theory, introduced by British mathematician and logician Alan Turing in 1936. It is a decision problem that can be stated as follows: Given a description of a program (or Turing machine) and an input, determine whether the program finishes running (halts) or continues to run indefinitely. Turing proved that there is no general algorithm that can solve the Halting problem for all possible program-input pairs.
The canonical undecidable problem.
New to topics? Read the docs here!