By submitting the following form, you agree to Club Z!'s Terms of Use, Privacy Policy and Consent Disclaimer
The halting problem asks for determination of whether a Turing machine will come to a halt given a particular input program.
undecidable
formulator | Alan Turing status | proved undecidable proof date | 1936 (89 years ago) prover | Alan Turing
mathematical problems | solved mathematics problems | undecidable mathematics problems
Back to List | POWERED BY THE WOLFRAM LANGUAGE