Отвъд машината на Тюринг: квантовият компютър

Sofia: BAS: ISSK (IPS) (2014)
Download Edit this record How to cite View on PhilPapers
Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection on how quantum computer might implement the idea of "infinite calculation" is the main subject.
PhilPapers/Archive ID
Upload history
Archival date: 2020-05-13
View other versions
Added to PP index

Total views
137 ( #32,279 of 55,800 )

Recent downloads (6 months)
108 ( #5,379 of 55,800 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.