aaronson-philosophy.pdf

N/A

Why Philosophers Should Care About Computational Complexity Scott Aaronson∗ Abstract One might think that, once we know something is computable, how efficiently it can be com- puted 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 the- ory—the field that studies the resources (such as time, space, and randomness) needed to solve…

saved by

• Sidhant Chaliha

related reading

• [1108.1791] Why Philosophers Should Care About Computational Complexityarxiv.org
• Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
• Shtetl-Optimized >> Blog Archive >> The First Law of Complexodynamicsscottaaronson.blog
• Computational Complexityblog.computationalcomplexity.org
• Complexity no Bar to AI · Gwern.netgwern.net
• Complexity class - Wikipediaen.wikipedia.org
• P versus NP problem - Wikipediaen.wikipedia.org
• pnp.pdfscottaaronson.com
• Reasons to believescottaaronson.blog
• Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
• Stephen Wolfram Writingswritings.stephenwolfram.com
• Complexity Theory’s 50-Year Journey to the Limits of Knowledge | Quanta Magazinequantamagazine.org