Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:describes |
the question of the existence of an algorithm to decide the truth of mathematical statements
|
| gptkbp:field |
gptkb:logic
theoretical computer science |
| gptkbp:formedBy |
gptkb:David_Hilbert
1928 |
| https://www.w3.org/2000/01/rdf-schema#label |
Entscheidungsproblem
|
| gptkbp:language |
gptkb:German
|
| gptkbp:notablePublication |
gptkb:"An_Unsolvable_Problem_of_Elementary_Number_Theory"_(Church,_1936)
"On Computable Numbers, with an Application to the Entscheidungsproblem" (Turing, 1936) |
| gptkbp:relatedTo |
gptkb:Church–Turing_thesis
gptkb:first-order_logic computability theory halting problem |
| gptkbp:solutionResult |
undecidable
|
| gptkbp:solutionYear |
1936
|
| gptkbp:solvedBy |
gptkb:Alan_Turing
gptkb:Alonzo_Church |
| gptkbp:translatedInto |
theoretical computer science
|
| gptkbp:bfsParent |
gptkb:On_Computable_Numbers,_with_an_Application_to_the_Entscheidungsproblem
|
| gptkbp:bfsLayer |
4
|