✳flâneur — a map of the web's best reading

[1108.1791] Why Philosophers Should Care About Computational Complexity

arxiv.org · 652 words · saved by 1 readers

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, computationalism, the problem of logical omniscience, Hume's problem of induction, Goodman's grue riddle, the foundations of quantum mechanics, economic rationality, closed timelike curves, and several other topics of philosophical interest. I end by discussing aspects of complexity theory itself that could benefit from philosophical analysis.

[1108.1791] Why Philosophers Should Care About Computational Complexity Skip to main content arXiv is now an independent nonprofit! Learn more × Search arXiv Press Enter to search · Advanced search --> Computer Science > Computational Complexity arXiv:1108.1791 (cs) [Submitted on 8 Aug 2011 ( v1 ), last revised 14 Aug 2011 (this version, v3)] Title: Why Philosophers Should Care About Computational Complexity Authors: Scott Aaronson View a PDF of the paper titled Why Philosophers Should Care About Computational Complexity, by Scott Aaronson View PDF Abstract: One might think that,

Explore this link on the map →

related reading