Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:alsoKnownAs |
halting problem
|
| gptkbp:describes |
the problem of determining whether a computer program will halt or run forever
|
| gptkbp:formedBy |
gptkb:Alan_Turing
1936 |
| https://www.w3.org/2000/01/rdf-schema#label |
Turing's halting problem
|
| gptkbp:implies |
there is no general algorithm to solve all instances of the problem
|
| gptkbp:provenBy |
gptkb:Alan_Turing
1936 |
| gptkbp:provenToBe |
undecidable
|
| gptkbp:relatedTo |
gptkb:Church–Turing_thesis
gptkb:Gödel's_incompleteness_theorems Technical Machine computability theory |
| gptkbp:usedIn |
gptkb:logic
recursion theory theoretical computer science |
| gptkbp:bfsParent |
gptkb:logic
|
| gptkbp:bfsLayer |
4
|