Turing's undecidability theorem
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Turing's_proof_of_the_undecidability_of_the_halting_problem
|
| gptkbp:field |
gptkb:logic
computability theory |
| gptkbp:formedBy |
gptkb:Alan_Turing
|
| https://www.w3.org/2000/01/rdf-schema#label |
Turing's undecidability theorem
|
| gptkbp:impact |
foundations of computer science
limits of computation |
| gptkbp:implies |
there exist problems no algorithm can solve
|
| gptkbp:publishedIn |
gptkb:On_Computable_Numbers,_with_an_Application_to_the_Entscheidungsproblem
|
| gptkbp:relatedTo |
gptkb:Gödel's_incompleteness_theorems
gptkb:Church-Turing_thesis halting problem |
| gptkbp:state |
The halting problem is undecidable
|
| gptkbp:year |
1936
|
| gptkbp:bfsParent |
gptkb:Church's_undecidability_theorem
|
| gptkbp:bfsLayer |
6
|