Halting problem (nonfiction): Difference between revisions

From Gnomon Chronicles
Jump to navigation Jump to search
Line 10: Line 10:


<gallery mode="traditional">
<gallery mode="traditional">
File:Ascleplius Myrmidon Halting Problem.jpg|link=Asclepius Myrmidon|[[Asclepius Myrmidon]] discovers unregistered Halting problem, predicts new class of [[crimes against mathematical constants]].
File:Ascleplius Myrmidon Halting Problem.jpg|link=On Halting Functions|[[On Halting Functions|Asclepius Myrmidon discovers unregistered Halting problem]], predicts new class of [[crimes against mathematical constants]].
File:Forbidden_Ratio_symbol.jpg|link=Forbidden Ratio and Gnotilus (crime team)|Supervillains [[Forbidden Ratio and Gnotilus (crime team)|Forbidden Ratio and Gnotilus]] threaten to [[Weaponization (nonfiction)|weaponize]] new class of Halting problems.
File:Forbidden_Ratio_symbol.jpg|link=Forbidden Ratio and Gnotilus (crime team)|Supervillains [[Forbidden Ratio and Gnotilus (crime team)|Forbidden Ratio and Gnotilus]] threaten to [[Weaponization (nonfiction)|weaponize]] new class of Halting problems.
File:Mathematical function.svg|link=Mathematical function (nonfiction)|Law-abiding [[Mathematical function (nonfiction)|mathematical functions]] have nothing to fear from [[Crimes against mathematical constants]], say crime authorities.
File:Mathematical function.svg|link=Mathematical function (nonfiction)|Law-abiding [[Mathematical function (nonfiction)|mathematical functions]] have nothing to fear from [[Crimes against mathematical constants]], say crime authorities.

Revision as of 13:28, 24 January 2017

Halting problem diagram.

In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running or continue to run forever. See Computation (nonfiction).

Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist.

A key part of the proof was a mathematical definition of a computer and program, which became known as a Turing machine; the halting problem is undecidable over Turing machines.

It is one of the first examples of a decision problem.

In the News

Fiction cross-reference

Nonfiction cross-reference

External links: