Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01420211n
Noun Concept
Categories: Pages with timeline metadata, 1936 introductions, Computability theory, Undecidable problems, Articles with short description
EN
halting problem  Determining whether a program is going to run forever  Halt problem  Halting predicate  Halting Theorem
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
Problem of determining whether a given program will finish running or continue forever Wikidata
A decision problem which can be stated as follows: given a description of a program and a finite input, decide whether the program finishes running or will run forever, given that input. OmegaWiki
The problem of deciding in finite time whether a given program will finish running in finite time, when given a certain finite input. Wiktionary
Problem in theoretical computer science. Wiktionary (translation)
IS A
computational problem
Wikipedia
EN
halting problem
Wikidata
EN
halting problem
Wiktionary
EN
halting problem
OmegaWiki
EN
halting problem
Wikipedia Redirections
EN
Determining whether a program is going to run forever, Halt problem, Halting predicate, Halting Problem, Halting Theorem, lossy Turing machine, the halting problem, Turing's halting problem, Turing's halting theorem

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License