= 27d567bc2d48d9f40e9ccc20ea370b15)
STL comments on [Link] Scott Aaronson on Why Philosophers Should Care About Computational Complexity - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (2)
That was excellent, thanks for the link. Despite the fact that I've read all of Aaronson's blog posts (and that I got a CS degree before becoming a code monkey), I learned several interesting tidbits. One example: MoR!Harry's trick is capable of solving all problems in PSPACE. (This was proven in 2009.)