Undecidable Problem - The Undecidable Problem in Computability Theory

The Undecidable Problem in Computability Theory

In computability theory, the halting problem is a decision problem which can be stated as follows:

Given the description of an arbitrary program and a finite input, decide whether the program finishes running or will run forever.

Alan Turing proved in 1936 that a general algorithm running on a Turing machine that solves the halting problem for all possible program-input pairs necessarily cannot exist. Hence, the halting problem is undecidable for Turing machines.

Read more about this topic:  Undecidable Problem

Famous quotes containing the words problem and/or theory:

    My problem lies in reconciling my gross habits with my net income.
    Errol Flynn (1909–1959)

    ... liberal intellectuals ... tend to have a classical theory of politics, in which the state has a monopoly of power; hoping that those in positions of authority may prove to be enlightened men, wielding power justly, they are natural, if cautious, allies of the “establishment.”
    Susan Sontag (b. 1933)