The Completeness: From Henkin’s Proposition to Quantum Computer

Vasil Penchev

Аннотация


The Completeness: From Henkin’s Proposition to Quantum Computer


Полный текст:

PDF (English)

Литература


Henkin L. A problem concerning provability, problem 3. J. Symb. Logic 17, 1952, p. 160.

Löb M. Solution of a problem of Leon Henkin. J. Symb. Logic 20, 1955, pp. 115-118.

Einstein, A., B. Podolsky, N. Rosen. Can Quantum-Mechanical Description of Physical Reality Be Considered Complete? Phys. Rev. 47 (1935), pp. 777- 780.

Deutsch D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. London A 400, 1985, pp. 97-117.

Deutsch D. Quantum computational networks. Proc. R. Soc. London A 425, 1989, pp. 73-90.

Albert D. On quantum-mechanical automata. Phys. Lett. A 98, 1983, pp. 249-252.

Albert D. A Quantum-Mechanical Automation. Philos. Sci. 54, 1987, pp. 577-585.

Gödel K. Über formal unentscheidbare Satze der Principia mathematica und verwandter Systeme I. Monatsh. Math. Phys. 38, 1931, pp. 173-198.

Jeroslow R. Consistency statements in formal mathematics. Fund. Math. 72, 1971, p. 1740.

Rogers H. Theory of Recursive Functions and Effective Computability. McGraw Hill, 1967.

Yourgrau P. A World Without Time: The Forgotten Legacy of Gödel and Einstein. Perseus Books Group, 2006.

Neumann J., Mathematische Grundlagen der Quantenmechanik. Springer, 1932.

Kochen S., E. Specker, The problem of hidden variables in quantum mechanics. J. Math. Mech. 17, 1968, pp. 59-87.


Ссылки

  • На текущий момент ссылки отсутствуют.


Bookmark and Share


(c) 2018 Vasil Penchev

Лицензия Creative Commons
Это произведение доступно по лицензии Creative Commons «Attribution-NonCommercial» («Атрибуция — Некоммерческое использование») 4.0 Всемирная.