Get Math Help

GET TUTORING NEAR ME!

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

    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

    Find the right fit or it’s free.

    We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.