Back to Results
First PageMeta Content
Computational complexity theory / Theory of computation / Complexity classes / Mathematical optimization / Structural complexity theory / Models of computation / P versus NP problem / NP / Reduction / Time complexity / Oracle machine / Low


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 computed is a practical question with little fu
Add to Reading List

Document Date: 2015-06-29 18:20:41


Open Document

File Size: 594,72 KB

Share Result on Facebook