How-Possibly Explanations in (Quantum) Computer Science

Citation data:

Philosophy of Science, ISSN: 0031-8248, Vol: 82, Issue: 5, Page: 737-748

Publication Year:
2015
Usage 498
Abstract Views 200
Downloads 165
HTML Views 109
Link-outs 24
Captures 17
Exports-Saves 16
Readers 1
Social Media 54
Shares, Likes & Comments 53
Tweets 1
Repository URL:
http://philsci-archive.pitt.edu/id/eprint/11588
DOI:
10.1086/683243
Author(s):
Michael E. Cuffaro
Publisher(s):
University of Chicago Press
Most Recent Tweet View All Tweets
article description
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.

This article has 0 Wikipedia mention.