- On the Significance of the Gottesman–Knill Theorem.Michael E. Cuffaro - 2017 - British Journal for the Philosophy of Science 68 (1):91-121.details
|
|
The Physical Church–Turing Thesis: Modest or Bold?Gualtiero Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733-769.details
|
|
Reconsidering No-Go Theorems from a Practical Perspective.Michael E. Cuffaro - 2018 - British Journal for the Philosophy of Science 69 (3):633-655.details
|
|
The Intrinsic Computational Difficulty of Functions.Alan Cobham - 1965 - In Yehoshua Bar-Hillel (ed.), Logic, methodology and philosophy of science. Amsterdam,: North-Holland Pub. Co.. pp. 24-30.details
|
|
Quantum Computation and Quantum Information.Michael A. Nielsen & Isaac L. Chuang - 2000 - Cambridge University Press.details
|
|
Quantum Computing Since Democritus.Scott Aaronson - 2013 - Cambridge University Press.details
|
|
(1 other version)Quantum Computation: Where Does the Speed-up Come From?Jeffrey Bub - 2010 - In Alisa Bokulich & Gregg Jaeger (eds.), Philosophy of quantum information and entanglement. New York: Cambridge University Press. pp. 231--246.details
|
|
An Introduction to Many Worlds in Quantum Computation.Clare Hewitt-Horsman - 2009 - Foundations of Physics 39 (8):869-902.details
|
|
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.details
|
|
(1 other version)Logical foundations of probability.Rudolf Carnap - 1950 - Chicago]: Chicago University of Chicago Press.details
|
|
The Many‐Worlds Interpretation and Quantum Computation.Armond Duwell - 2007 - Philosophy of Science 74 (5):1007-1018.details
|
|
(2 other versions)Principles of Mathematical Logic.G. Zubieta R. - 1951 - Journal of Symbolic Logic 16 (1):52-53.details
|
|
Quantum hypercomputation—hype or computation?Amit Hagar & Alex Korolev - 2007 - Philosophy of Science 74 (3):347-363.details
|
|
(1 other version)Computing machinery and intelligence.Alan M. Turing - 1950 - Mind 59 (October):433-60.details
|
|
(1 other version)Quantum Speed‐up of Computations.Itamar Pitowsky - 2002 - Philosophy of Science 69 (S3):S168-S177.details
|
|
(1 other version)Quantum Information Theory and the Foundations of Quantum Mechanics.Christopher Gordon Timpson - 2013 - Oxford, GB: Oxford University Press.details
|
|
Why philosophers should care about computational complexity.Scott Aaronson - 2013 - Computability: Turing, Gödel, Church, and Beyond:261--328.details
|
|
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.details
|
|
Algorithms for quantum computation: Discrete logarithms and factoring.P. Shor - 1994 - Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science:124-134.details
|
|
Algorithms and the mathematical foundations of computer science.W. Dean - forthcoming - Notre Dame Journal of Formal Logic.details
|
|
Church's Thesis and Principles for Mechanisms.Robin Gandy - 1980 - In The Kleene Symposium. North-Holland. pp. 123--148.details
|
|
"Exists" as a predicate.George Nakhnikian & Wesley C. Salmon - 1957 - Philosophical Review 66 (4):535-542.details
|
|
(1 other version)The interactive nature of computing: Refuting the strong church–turing thesis. [REVIEW]Dina Goldin & Peter Wegner - 2008 - Minds and Machines 18 (1):17-38.details
|
|
(1 other version)Principles of Mathematical Logic.D. Hilbert, W. Ackermann & Robert E. Luce - 1952 - Philosophy 27 (103):375-376.details
|
|
(1 other version)Logical Foundations of Probability.Rudolf Carnap - 1950 - Mind 62 (245):86-99.details
|
|
The Physical Church Thesis and Physical Computational Complexity.Itamar Pitowski - 1990 - Iyyun 39:81-99.details
|
|
One complexity theorist's view of quantum computing.Lance Fortnow - 2003 - Theoretical Computer Science 292:597--610.details
|
|
Many worlds, the cluster-state quantum computer, and the problem of the preferred basis.Michael E. Cuffaro - 2012 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 43 (1):35-42.details
|
|
(1 other version)A quantum computer only needs one universe.A. M. Steane - 2003 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 34 (3):469-478.details
|
|
(1 other version)Quantum speed-up of computations.Itamar Pitowsky - 2002 - Proceedings of the Philosophy of Science Association 2002 (3):S168-S177.details
|
|
(1 other version)Quantum Information Theory & the Foundations of Quantum Mechanics.Christopher Gordon Timpson - 2004 - Oxford, GB: Oxford University Press.details
|
|
(1 other version)Computing Machinery and Intelligence.Alan M. Turing - 2003 - In John Heil (ed.), Philosophy of Mind: A Guide and Anthology. New York: Oxford University Press.details
|
|
Turing A. M.. On computable numbers, with an application to the Entscheidungs problcm. Proceedings of the London Mathematical Society, 2 s. vol. 42 , pp. 230–265. [REVIEW]Alonzo Church - 1937 - Journal of Symbolic Logic 2 (1):42-43.details
|
|
(1 other version)The Interactive Nature of Computing: Refuting the Strong Church–Turing Thesis.D. Goldin & P. Wegner - 2008 - Minds and Machines 18 (1):17-38.details
|
|
Quantum algorithms: Philosophical lessons.Amit Hagar - 2007 - Minds and Machines 17 (2):233-247.details
|
|
(1 other version)A quantum computer only needs one universe.A. M. Steane - 2003 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 34 (3):469-478.details
|
|
On the Computational Complexity of Algorithms.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):120-121.details
|
|
Evidence for the Epistemic View of Quantum States: A Toy Theory.Robert W. Spekkens - 2007 - Physical Review A 75:032110.details
|
|