Church–Turing–Deutsch principle
GPTKB entity
Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:computational_principle
|
| gptkbp:describes |
universality of physical systems for computation
|
| gptkbp:field |
gptkb:theoretical_computer_science
philosophy of computation |
| gptkbp:formedBy |
gptkb:David_Deutsch
|
| gptkbp:namedAfter |
gptkb:Alan_Turing
gptkb:Alonzo_Church gptkb:David_Deutsch |
| gptkbp:relatedTo |
gptkb:Church–Turing_thesis
gptkb:quantum_computing |
| gptkbp:requires |
every finitely realizable physical system can be perfectly simulated by a universal computing machine operating by finite means
|
| gptkbp:statedIn |
1985
|
| gptkbp:bfsParent |
gptkb:physical_Church–Turing_thesis
gptkb:strong_Church–Turing_thesis |
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Church–Turing–Deutsch principle
|