Geodesic
Машины, логика и квантовая физика
Matematicheskoe Prosveshchenie, Matematicheskoe Prosveshchenie (2001), pp. 47-60.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{MP_2001_a4,
     author = {D. Deutsch and A. Ekert and R. Lupacchini},
     title = {{\CYRM}{\cyra}{\cyrsh}{\cyri}{\cyrn}{\cyrery}, {\cyrl}{\cyro}{\cyrg}{\cyri}{\cyrk}{\cyra} {\cyri} {\cyrk}{\cyrv}{\cyra}{\cyrn}{\cyrt}{\cyro}{\cyrv}{\cyra}{\cyrya} {\cyrf}{\cyri}{\cyrz}{\cyri}{\cyrk}{\cyra}},
     journal = {Matematicheskoe Prosveshchenie},
     pages = {47--60},
     publisher = {mathdoc},
     year = {2001},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MP_2001_a4/}
}
TY  - JOUR
AU  - D. Deutsch
AU  - A. Ekert
AU  - R. Lupacchini
TI  - Машины, логика и квантовая физика
JO  - Matematicheskoe Prosveshchenie
PY  - 2001
SP  - 47
EP  - 60
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MP_2001_a4/
LA  - ru
ID  - MP_2001_a4
ER  - 
%0 Journal Article
%A D. Deutsch
%A A. Ekert
%A R. Lupacchini
%T Машины, логика и квантовая физика
%J Matematicheskoe Prosveshchenie
%D 2001
%P 47-60
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MP_2001_a4/
%G ru
%F MP_2001_a4
D. Deutsch; A. Ekert; R. Lupacchini. Машины, логика и квантовая физика. Matematicheskoe Prosveshchenie, Matematicheskoe Prosveshchenie (2001), pp. 47-60. http://geodesic.mathdoc.fr/item/MP_2001_a4/

[1] Bernstein E., Vazirani U., “Quantum complexity theory”, Proc. of the 25th Ann. Symp. on the Theory of Comput., ACM, New York, 1993, 11–20

[2] Cleve R., Ekert A., Macchiavello C., Mosca M., “Quantum Algorithms Revisited”, Proc. of the Royal Soci., A, 454 (1998), 339–354 | DOI | MR | Zbl

[3] Deutsch D., “Quantum theory, the Church-Turing principle and the universal quantum computer”, Proc. of the Royal Soc., A, 400 (1985), 97–117 | DOI | MR | Zbl

[4] Feynman R. P., “Simulating physics with computers”, Int. J. of Theor. Physics, 21 (1982), 467–488 | DOI | MR

[5] Galilei G., Saggiatore, 1623. / Opere, vol. 6, ed. Favaro A., Edizione Nazionale, Firenze, 1896

[6] Goldstine H. H., The Computer from Pascal to von Neumann, Princeton University Press, Princeton, 1972 | MR | Zbl

[7] Papadimitriou S. N., Computational Complexity, Addison-Wesley, Reading, 1994 | MR | Zbl

[8] Penrose R., Shadows of the mind, Oxford University Press, Oxford, 1994 | MR

[9] Rivest R., Shamir A., Adleman L., On Digital Signatures and Public-Key Cryptosystems, Tech. Rep. MIT/LCS/TR-212, MIT Laboratory for Computer Science, January 1979

[10] Shor P., “Algorithms for quantum computation: discrete log and factoring”, Proc. of the 35th Ann. Symp. on the Foundations of Computer Science, ed. S. Goldwasser, IEEE Computer Society Press, Los Alamitos, 1994, 124–134 | MR

[11] Turing A., “On computable numbers with an application to the Entscheidungsproblem”, Proc. of the London Math. Soc., 2, 42 (1936–37), 230–265 | DOI | Zbl

[12] Wigner E. P., “The unreasonable effectiveness of mathematics in the natural sciences”, Comm. on Pure and Appl. Math., 13 (1960), 1–14 | DOI | Zbl