Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:philosophy
|
| gptkbp:alsoKnownAs |
gptkb:Church–Turing_thesis
|
| gptkbp:category |
gptkb:theoretical_computer_science
gptkb:logic |
| gptkbp:debatedBy |
gptkb:physical_Church–Turing_thesis
limits of computation |
| gptkbp:field |
computability theory
philosophy of computer science |
| gptkbp:formedBy |
gptkb:Alan_Turing
gptkb:Alonzo_Church |
| gptkbp:influenced |
gptkb:theoretical_computer_science
gptkb:artificial_intelligence gptkb:logic philosophy of mind |
| gptkbp:publishedIn |
gptkb:American_Journal_of_Mathematics
gptkb:Proceedings_of_the_London_Mathematical_Society |
| gptkbp:relatedConcept |
gptkb:lambda_calculus
gptkb:Technical_Machine recursive functions |
| gptkbp:state |
Any function that can be effectively calculated by an algorithm can be computed by a Turing machine
|
| gptkbp:yearProposed |
1936
|
| gptkbp:bfsParent |
gptkb:Church–Turing_thesis
|
| gptkbp:bfsLayer |
5
|
| https://www.w3.org/2000/01/rdf-schema#label |
Turing–Church thesis
|