Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
discrete deterministic mechanical devices
|
| gptkbp:concerns |
mechanical computation
computability |
| gptkbp:field |
gptkb:logic
theoretical computer science |
| gptkbp:generalizes |
gptkb:Church–Turing_thesis
|
| https://www.w3.org/2000/01/rdf-schema#label |
Gandy's theorem
|
| gptkbp:namedAfter |
gptkb:Robin_Gandy
|
| gptkbp:publicationYear |
1980
|
| gptkbp:publishedIn |
On the axioms of computation
|
| gptkbp:state |
Any function computable by a discrete deterministic mechanical device is computable by a Turing machine
|
| gptkbp:bfsParent |
gptkb:Robin_Gandy
|
| gptkbp:bfsLayer |
5
|