- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Reflections on quantum computing
Complexity 6 (1):35-37 (2000)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Jeffrey Shallit and Ming-Wei Wang. Automatic complexity of strings. Journal of Automata, Languages and Combinatorics, vol. 6 , pp. 537–554. - Cristian S. Calude, Kai Salomaa and Tania K. Roblot. Finite-state complexity and randomness. Theoretical Computer Science, vol. 412 , no. 41, pp. 5668–5677. - Cristian S. Calude, Kai Salomaa and Tania K. Roblot. State-size hierarchy for finite-state complexity. International Journal of Foundations of Computer Science, vol. 23 , no. 1, pp. 37–50. [REVIEW]Mia Minnes - 2012 - Bulletin of Symbolic Logic 18 (4):579-580.
Homo Sapiens, Homo Faber and Homo Dictyous. Creatively united by computing science.Cătălin Mamali - 2016 - Filozofia Publiczna I Edukacja Demokratyczna 5 (2):133-156.
On the Role of Quantum Computing in Grounding Morphological Complexity.Martina Properzi - 2018 - International Journal of Current Advanced Research 7 (9):15444-15448.
One complexity theorist's view of quantum computing.Lance Fortnow - 2003 - Theoretical Computer Science 292:597--610.
Universality, Invariance, and the Foundations of Computational Complexity in the light of the Quantum Computer.Michael Cuffaro - 2018 - In Hansson Sven Ove (ed.), Technology and Mathematics: Philosophical and Historical Investigations. Cham, Switzerland: Springer Verlag. pp. 253-282.
Incompleteness, complexity, randomness and beyond.Cristian S. Calude - 2002 - Minds and Machines 12 (4):503-517.
Ethics of Quantum Computing: an Outline.Luca M. Possati - 2023 - Philosophy and Technology 36 (3):1-21.
Analytics
Added to PP
2014-01-20
Downloads
25 (#150,191)
6 months
7 (#1,397,300)
2014-01-20
Downloads
25 (#150,191)
6 months
7 (#1,397,300)
Historical graph of downloads
Author's Profile
Citations of this work
Hypercomputation and the Physical Church‐Turing Thesis.Paolo Cotogno - 2003 - British Journal for the Philosophy of Science 54 (2):181-223.
Incompleteness, complexity, randomness and beyond.Cristian S. Calude - 2002 - Minds and Machines 12 (4):503-517.
Effective Physical Processes and Active Information in Quantum Computing.Ignazio Licata - 2007 - Quantum Biosystems 1 (1):51-65.
References found in this work
Speakable and unspeakable in quantum mechanics: collected papers on quantum philosophy.John Stewart Bell - 1987 - New York: Cambridge University Press.
Impossibility: the limits of science and the science of limits.John D. Barrow - 1998 - New York: Oxford University Press.
Computability by Probabilistic Machines.K. de Leeuw, E. F. Moore, C. E. Shannon & N. Shapiro - 1970 - Journal of Symbolic Logic 35 (3):481-482.
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.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-grz79 uwo