GET TUTORING NEAR ME!

By submitting the following form, you agree to Club Z!'s Terms of Use, Privacy Policy and Consent Disclaimer

    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 (89 years ago) prover | Alan Turing

    Back to List | POWERED BY THE WOLFRAM LANGUAGE