Church-Turing-Deutsch principle
GPTKB entity
Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computational principle
|
| gptkbp:alsoKnownAs |
gptkb:Church-Turing-Deutsch_hypothesis
|
| gptkbp:field |
theoretical computer science
philosophy of computation |
| https://www.w3.org/2000/01/rdf-schema#label |
Church-Turing-Deutsch principle
|
| gptkbp:influencedBy |
gptkb:Alan_Turing
gptkb:Alonzo_Church |
| gptkbp:proposedBy |
gptkb:David_Deutsch
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_Royal_Society_of_London_A
|
| gptkbp:relatedTo |
gptkb:Church-Turing_thesis
quantum computation |
| gptkbp:state |
Every finitely realizable physical system can be perfectly simulated by a universal computing machine operating by finite means.
|
| gptkbp:yearProposed |
1985
|
| gptkbp:bfsParent |
gptkb:physical_Church-Turing_thesis
|
| gptkbp:bfsLayer |
7
|