Get Math Help

GET TUTORING NEAR ME!

(800) 434-2582

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

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

    Classes

    mathematical problems | solved mathematics problems | undecidable mathematics problems

    Back to List | POWERED BY THE WOLFRAM LANGUAGE