Halting problem
In computability theory, the halting problem is the decision problem of determining, from a description of an arbitrary computer program and an input, whether the program will eventually halt (finish running) or continue to run forever. Alan Turing proved in 1936 that the halting problem is undecidable, meaning that no general algorithm exists that can correctly solve the problem for all possible program–input pairs. The problem comes up often in discussions of computability since it demonstrates that some functions are mathematically definable but not computable.
Halting problem - Wikipedia Jump to content From Wikipedia, the free encyclopedia Problem in computer science This article includes a list of general references but lacks corresponding inline citations . Please help improve this article by introducing more precise citations. ( September 2018 ) ( Learn how and when to remove this message ) In computability theory , the halting problem is the decision problem of, given an arbitrary computer program and an input, determining whether said program will eventually finish running and halt, or will continue to run forever. [ 1 ] [ 2 ] [ 3 ] Alan Turin
Explore this link on the map →related reading
- Decision problem - Wikipediaen.wikipedia.org
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Chaitin's constant - Wikipediaen.wikipedia.org
- Turing Machinessamwho.dev
- The Church-Turing Thesis (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Turing Machines | Brilliant Math & Science Wikibrilliant.org
- alan turing - computing machinery and intelligencecourses.cs.umbc.edu
- Gödel's incompleteness theorems - Wikipediaen.wikipedia.org
- Church–Turing thesis - Wikipediaen.wikipedia.org
- Turing machine - Wikipediaen.wikipedia.org
- Computable function - Wikipediaen.wikipedia.org
- An Intuitive Explanation of Solomonoff Induction — LessWronglesswrong.com