Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Church–Turing_thesis
|
| gptkbp:field |
gptkb:logic
theoretical computer science |
| gptkbp:formedBy |
gptkb:Alan_Turing
gptkb:Alonzo_Church 1936 |
| https://www.w3.org/2000/01/rdf-schema#label |
Church's conjecture
|
| gptkbp:implies |
limits of computation
definition of algorithm undecidability results |
| gptkbp:influenced |
gptkb:artificial_intelligence
computability theory computer science philosophy of mind |
| gptkbp:publishedIn |
gptkb:American_Journal_of_Mathematics
|
| gptkbp:relatedTo |
gptkb:lambda_calculus
Technical Machine recursive function |
| gptkbp:state |
Every effectively calculable function is computable by a Turing machine
|
| gptkbp:status |
unproven
|
| gptkbp:bfsParent |
gptkb:Church–Turing_thesis
|
| gptkbp:bfsLayer |
5
|