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

First Page		Document Content
Date: 2015-06-29 18:20:41 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 Source URL: www.scottaaronson.com Download Document from Source Website File Size: 594,72 KB Share Document on Facebook

	Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai† DocID: 1xUdf - View Document
	Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve NP-co DocID: 1xTKi - View Document
	PDF Document DocID: 1xSVG - View Document
	PDF Document DocID: 1xSM6 - View Document
	PDF Document DocID: 1xSJs - View Document