Media Coverage

Boston.com

August 16, 2011

"In a new paper, " Why Philosophers Should Care About Computational Complexity," Scott Aaronson, a computer scientist at MIT, explains why computational complexity theorists believe that some problems are practically uncomputable. He lays out some of the implications this might have for some of the biggest questions in philosophy, physics, biology, and economics."

Go to News Coverage

Other Coverage