Hilbert's Entscheidungsproblem
GPTKB entity
Statements (61)
Predicate | Object |
---|---|
gptkbp:instance_of |
gptkb:Mathematics
|
gptkbp:concluded_on |
no general algorithm exists
|
gptkbp:field |
gptkb:Mathematics
|
https://www.w3.org/2000/01/rdf-schema#label |
Hilbert's Entscheidungsproblem
|
gptkbp:impact |
theoretical computer science
mathematical logic |
gptkbp:influenced_by |
gptkb:Gödel's_incompleteness_theorems
|
gptkbp:is_a_solution_for |
gptkb:Alonzo_Church
gptkb:Alan_Turing |
gptkbp:notable_release |
1928
|
gptkbp:proposed_by |
gptkb:David_Hilbert
|
gptkbp:related_concept |
gptkb:Set
gptkb:Judge gptkb:P_vs_NP_problem gptkb:NP-completeness gptkb:Church-Turing_thesis gptkb:theorem gptkb:constructivism gptkb:historical_significance formal verification first-order logic formal proofs syntax and semantics computational complexity mathematical foundations mathematical reasoning philosophy of mathematics axiomatic systems computability theory formal languages model theory automated theorem proving research in mathematics proof theory recursive functions complexity classes computational limits computational models undecidable problems theoretical implications formalism philosophical implications proof assistants logical consequence logical paradoxes mathematical discourse mathematical exploration logical systems mathematical consistency mathematical challenges axiomatization mathematical intuitionism mathematical paradoxes algorithmic problem mathematical logic history future of mathematics platonism in mathematics |
gptkbp:related_to |
decidability
formal systems |
gptkbp:bfsParent |
gptkb:On_Computable_Numbers
|
gptkbp:bfsLayer |
4
|