In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running or continue to run forever. Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist. A key p...
Found on
http://en.wikipedia.org/wiki/Halting_problem
(from the article `Turing machine`) ...be read from the system once the machine has stopped. (However, in the case of Gödel`s undecidable propositions, the machine would never stop, and ... ...of problems is undecidable is particularly suggestive. Once the concept of mechanical procedure was crystallized, it was relatively easy to ...
Found on
http://www.britannica.com/eb/a-z/h/9
Given a program and inputs for it, decide whether it will run forever or will eventually stop. This is not the same thing as actually running a given program and seeing what happens. The halting problem asks whether there is any general prescription for deciding how long to run an arbitrary program ...
Found on
http://www.daviddarling.info/encyclopedia/H/halting_problem.html
The problem of determining if a program halts or doesn't halt on a particular input. This is an incomputable problem.
Found on
http://www.encyclo.co.uk/local/20090
No exact match found.
