Quantum algorithms: Philosophical lessons

Minds and Machines 17 (2):233-247 (2007)
Abstract This article has no associated abstract. (fix it)
Keywords Computational complexity   Quantum computing   The Church-Turing thesis
Categories (categorize this paper)
DOI 10.1007/s11023-007-9057-3
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,411
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Stephen Wolfram (2013). 21 Undecidability and Intractability in Theoretical Physics. Emergence: Contemporary Readings in Philosophy and Science.
B. Jack Copeland (2002). Hypercomputation. Minds and Machines 12 (4):461-502.

View all 16 references / Add more references

Citations of this work BETA
E. Cuffaro Michael (2015). On the Significance of the Gottesman–Knill Theorem. British Journal for the Philosophy of Science:axv016.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

59 ( #82,666 of 1,924,718 )

Recent downloads (6 months)

7 ( #124,767 of 1,924,718 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.