In computability theory, the halting problem is the decision problem of determining, from a description of an arbitrary computer program and an input, whether the program will eventually halt (finish running) or continue to run forever. Alan Turing proved in 1937 that the halting problem is undecidable, meaning that no general algorithm exists that can correctly solve the problem for all possible program–input pairs.
In computability theory, the halting problem is the decision problem of determining, from a description of an arbitrary computer program and an input, whether the program will eventually halt (finish running) or continue to run forever. Alan Turing proved in 1937 that the halting problem is undecidable, meaning that no general algorithm exists that can correctly solve the problem for all possible program–input pairs.
Source: Wikipedia "Halting problem" · CC BY-SA 4.0
Share this article: X · Bluesky