Abstract
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 in so doing 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.
| Item Type: | Journal article |
|---|---|
| Keywords: | how-possibly; computer science; algorithms; algorithmic explanation; quantum computation |
| Faculties: | Philosophy, Philosophy of Science and Religious Science > Munich Center for Mathematical Philosophy (MCMP) Philosophy, Philosophy of Science and Religious Science > Munich Center for Mathematical Philosophy (MCMP) > Philosophy of Science |
| Subjects: | 100 Philosophy and Psychology > 100 Philosophy |
| ISSN: | 00318248 |
| Language: | English |
| Item ID: | 21454 |
| Date Deposited: | 19. Sep 2014 06:05 |
| Last Modified: | 03. Mar 2017 10:52 |
Actions (login required)
- View Item
