Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:philosophy
gptkb:computability_theory_concept |
| gptkbp:alsoKnownAs |
gptkb:Church-Turing_thesis
|
| gptkbp:field |
gptkb:theoretical_computer_science
gptkb:logic |
| gptkbp:formedBy |
gptkb:Alan_Turing
gptkb:Alonzo_Church |
| gptkbp:implies |
undecidability
limits of computation definition of algorithm |
| gptkbp:influenced |
gptkb:artificial_intelligence
gptkb:logic computability theory philosophy of mind |
| gptkbp:notATheorem |
true
|
| gptkbp:relatedTo |
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 |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Turing-Church thesis
|