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

Sofia: BAS: ISSK (IPS) (2014)
  Copy   BIBTEX

Abstract

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.

Author's Profile

Vasil Penchev
Bulgarian Academy of Sciences

Analytics

Added to PP
2020-05-13

Downloads
427 (#19,942)

6 months
43 (#23,928)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?