Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
undecidable problem |
| gptkbp:appliesTo |
Turing machines
|
| gptkbp:complexity |
RE-complete
|
| gptkbp:consequence |
limits of computation
|
| gptkbp:describedBy |
gptkb:On_Computable_Numbers,_with_an_Application_to_the_Entscheidungsproblem
|
| gptkbp:field |
computer science
|
| gptkbp:hasApplication |
theoretical computer science
formal verification program analysis |
| https://www.w3.org/2000/01/rdf-schema#label |
Halting problem
|
| gptkbp:implies |
there is no general algorithm to solve all instances
|
| gptkbp:introduced |
gptkb:Alan_Turing
|
| gptkbp:introducedIn |
1936
|
| gptkbp:isUndecidable |
true
|
| gptkbp:relatedTo |
gptkb:Gödel's_incompleteness_theorems
gptkb:Rice's_theorem computability theory |
| gptkbp:solvedBy |
no general solution exists
|
| gptkbp:symbol |
gptkb:HALT
|
| gptkbp:bfsParent |
gptkb:Rice's_theorem
|
| gptkbp:bfsLayer |
5
|