(800) 434-2582
Call Now! Franchise Info

Get Math Help

Math Reading Science Test Prep

GET TUTORING NEAR ME!

By providing your phone number, you consent to receive text messages from Club Z! for purposes related to our services. Message frequency may vary. Message and Data Rates may apply. Reply HELP for help or STOP to unsubscribe. See our Privacy Policy and our Terms and Conditions page

    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

    Classes

    mathematical problems | solved mathematics problems | undecidable mathematics problems

    Back to List | POWERED BY THE WOLFRAM LANGUAGE