|
gptkbp:instanceOf
|
gptkb:philosophy
computability theory concept
|
|
gptkbp:alternativeName
|
gptkb:Church's_conjecture
gptkb:Church's_thesis
gptkb:Turing's_thesis
gptkb:Turing–Church_thesis
|
|
gptkbp:compatibleWith
|
gptkb:mathematical_concept
|
|
gptkbp:debatedBy
|
gptkb:physical_Church–Turing_thesis
gptkb:strong_Church–Turing_thesis
hypercomputation
limits of computation
|
|
gptkbp:field
|
gptkb:logic
theoretical computer science
|
|
gptkbp:formedBy
|
1930s
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Church–Turing thesis
|
|
gptkbp:influenced
|
gptkb:artificial_intelligence
philosophy of mind
development of computer science
|
|
gptkbp:influencedBy
|
gptkb:Hilbert's_problems
gptkb:Entscheidungsproblem
|
|
gptkbp:namedAfter
|
gptkb:Alan_Turing
gptkb:Alonzo_Church
|
|
gptkbp:referencedIn
|
gptkb:On_Computable_Numbers,_with_an_Application_to_the_Entscheidungsproblem
gptkb:An_Unsolvable_Problem_of_Elementary_Number_Theory
gptkb:Computability_and_Unsolvability
gptkb:The_Entscheidungsproblem
|
|
gptkbp:relatedConcept
|
gptkb:lambda_calculus
Technical Machine
effective calculability
recursive function
|
|
gptkbp:state
|
Any function that can be effectively calculated by an algorithm can be computed by a Turing machine
|
|
gptkbp:bfsParent
|
gptkb:Alonzo_Church
gptkb:On_Computable_Numbers,_with_an_Application_to_the_Entscheidungsproblem
gptkb:logic
gptkb:Technical_Machine
|
|
gptkbp:bfsLayer
|
4
|