A primary goal of quantum computer science is to find an explanation for the fact that quantum computers are more powerful than classical computers. In this paper I argue that to answer this question is to compare algorithmic processes of various kinds and to describe the possibility spaces associated with these processes. By doing this, we explain how it is possible for one process to outperform its rival. Further, in this and similar examples little is gained in subsequently asking a how-actually question. Once one has explained how-possibly, there is little left to do.
CITATION STYLE
Cuffaro, M. E. (2015). How-possibly explanations in (Quantum) computer science. Philosophy of Science, 82(5), 737–748. https://doi.org/10.1086/683243
Mendeley helps you to discover research relevant for your work.