Halting problem (nonfiction): Difference between revisions
| Line 23: | Line 23: | ||
* [[Computation (nonfiction)]] | * [[Computation (nonfiction)]] | ||
* [[Computer science (nonfiction)]] | * [[Computer science (nonfiction)]] | ||
* [[Weapon (nonfiction)]] | |||
* [[Weaponization (nonfiction)]] | |||
External links: | |||
* [https://en.wikipedia.org/wiki/Halting_problem Halting problem] @ Wikipedia | * [https://en.wikipedia.org/wiki/Halting_problem Halting problem] @ Wikipedia | ||
[[Category:Nonfiction (nonfiction)]] | [[Category:Nonfiction (nonfiction)]] | ||
Revision as of 09:46, 21 June 2016
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
Asclepius Myrmidon discovers unregistered Halting problem, forecasts multiple casualties from Pi disaster.
Supervillains Forbidden Ratio and Gnotilus threaten to weaponize new class of Halting problems.
Law-abiding mathematical functions have nothing to fear from Crimes against mathematical constants, say crime authorities.
Fiction cross-reference
Nonfiction cross-reference
- Computation (nonfiction)
- Computer science (nonfiction)
- Weapon (nonfiction)
- Weaponization (nonfiction)
External links:
- Halting problem @ Wikipedia