Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:philosophy
|
| gptkbp:alsoKnownAs |
gptkb:Church–Turing_thesis
|
| gptkbp:basisFor |
definition of algorithm
definition of computable function |
| gptkbp:debatedBy |
philosophers
computer scientists |
| gptkbp:describes |
limits of computability
|
| gptkbp:field |
gptkb:theoretical_computer_science
gptkb:logic |
| gptkbp:formedBy |
gptkb:Alan_Turing
gptkb:Alonzo_Church |
| gptkbp:influenced |
gptkb:artificial_intelligence
computability theory philosophy of mind |
| gptkbp:notATheorem |
not formally provable
|
| gptkbp:relatedTo |
gptkb:lambda_calculus
gptkb:Technical_Machine recursive functions |
| gptkbp:state |
Every effectively calculable function is computable 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 |
Church's thesis
|