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
Options
 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
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,167
Through your library
References found in this work BETA
Special Sciences.Jerry A. Fodor - 1974 - Synthese 28 (2):97-115.
21 Undecidability and Intractability in Theoretical Physics.Stephen Wolfram - 2013 - Emergence: Contemporary Readings in Philosophy and Science.
Hypercomputation.B. Jack Copeland - 2002 - Minds and Machines 12 (4):461-502.

View all 16 references / Add more references

Citations of this work BETA
On the Significance of the Gottesman–Knill Theorem.MIchael E. Cuffaro - 2017 - British Journal for the Philosophy of Science 68 (1):91-121.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

60 ( #84,996 of 2,153,488 )

Recent downloads (6 months)

2 ( #280,610 of 2,153,488 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums