 |
| Why Philosophers Should Care About Computational Complexity [pdf] (scottaaronson.com) | ||
| recommended by 2 users | 2015 | 160 points by fbrusch | algorithms & theory | original thread | | ||
| 2 users recommended this thread. What they said: |
| diego898 Feb 19, 2015 | on: Scott Aaronson, from computational complexity to quantum… | context |
|
giech Jul 14, 2015 | on: NP-Complete Problems and Physical Reality (2005) | context
His Philosophy-Complexity paper is also fantastic, in case you have not read it already: http://www.scottaaronson.com/papers/philos.pdf It has also been discussed most recently here: https://news.ycombinator.com/item?id=9061744 |
| Also recommended by people who recommended this: | ||
| 1. | Why Philosophers Should Care About Computational Complexity (scottaaronson.com) | |
| recommended by 2 users | 2011 | 140 points by sweis | original thread | | ||
| 2. | Spaced repetition (gwern.net) | |
| recommended by 1 user | 2016 | 299 points by ergot | original thread | | ||
another great interview! I really enjoy all of nautil.us articles and am very happy Scott did one. I of course recommend all of Scotts essays, including "Why philosophers should care about computational complexity theory" [1] that was submitted to HN recently with some great discussion.
Also, I highly recommend another one of their ingengious series: David Deutsch [2]
[1]: https://news.ycombinator.com/item?id=9061744 [2]: http://nautil.us/issue/2/uncertainty/ingenious-david-deutsch