A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Why Philosophers Should Care about Computational Complexity
[chapter]
2013
Computability
One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong. In particular, I argue that computational complexity theory-the field that studies the resources (such as time, space, and randomness) needed to solve computational problems-leads to new perspectives on the nature of mathematical knowledge, the strong AI debate,
doi:10.7551/mitpress/8009.003.0011
fatcat:sk6y4k62xbfgdn4nytamdeq6my