Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:philosophy
|
| gptkbp:alsoKnownAs |
gptkb:Church–Turing–Deutsch_principle
|
| gptkbp:challenge |
gptkb:quantum_computing
|
| gptkbp:field |
theoretical computer science
philosophy of computation |
| https://www.w3.org/2000/01/rdf-schema#label |
strong Church–Turing thesis
|
| gptkbp:implies |
no physically realizable computing device can solve problems faster than a probabilistic Turing machine
|
| gptkbp:proposedBy |
gptkb:David_Deutsch
|
| gptkbp:relatedTo |
gptkb:Church–Turing_thesis
theoretical computer science |
| gptkbp:state |
any physically realizable computation can be efficiently simulated by a probabilistic Turing machine
|
| gptkbp:bfsParent |
gptkb:Church–Turing_thesis
|
| gptkbp:bfsLayer |
5
|