bn:01420211n
Noun Concept
Categories: Theory of computation, All articles needing additional references, Mathematical problems, Articles with short description, 1936 introductions
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)