Quantum mechanics and algorithmic randomness

Complexity

Volumn 6, Issue 1, 2000, Pages 27-34

  Yurtsever, Ulvi ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85016807964     PISSN: 10762787     EISSN: 10990526     Source Type: Journal    
DOI: 10.1002/1099-0526(200009/10)6:1<27::AID-CPLX1004>3.0.CO;2-R     Document Type: Article

References (13)

1. Li, M.; Vitanyi, P. An Introduction to Kolmogorov Complexity and Its Applications. Springer-Verlag: New York, 1993.
2. Shamir, A. In Proceedings of ICALP. Springer: New York, 1981.
3. Also see M. Bellare and S. Goldwasser, Lecture Notes on Cryptography, available on the World Wide Web at http://www-cse.ucsd.edu/users/mihir/papers/gb.html/.
4. Chaitin, G.J. Int J Theor Phys 1982, 22, 941.
5. Knuth, D.E. The Art of Computer Programming. Vol. 2: Seminumerical Algorithms. Addison Wesley Longman: Reading, MA, 1998.
6. Bell, J.S. Physics 1964, 1, 195. Also reprinted in Speakable and Unspeakable in Quantum Mechanics; Cambridge University Press: Cambridge, MA, 1987.
7. Chatin, G.J. IBM J Res Dev 1977; 21, 350; Adv Appl Math 1987, 8, 119.
8. Shannon, C.E. Bell Sys Tech 1948, 27, 379; 623.
9. See also C.E. Shannon and W.W. Weaver, The Mathematical Theory of Communication; University of Illinois Press; Urbana, 1949.
10. Yurtsever, U. Manuscript in preparation.
11. Cover, T.M.; Thomas, J.A. Elements of Information Theory. Wiley-Interscience: New York, 1991.
12. Gardner, M. Sci Am 1979, 241, 20.
13. Caves, C.M.; Fuchs, C.A. Quantum Information: How Much Information in a State Vector? 1996, quant-ph/9601025.