Home / Get Math Help
Halting Problem
Statement
The halting problem asks for determination of whether a Turing machine will come to a halt given a particular input program.
Solution
undecidable
History
formulator | Alan Turing status | proved undecidable proof date | 1936 (90 years ago) prover | Alan Turing