{"id":735,"date":"2011-08-08T15:41:59","date_gmt":"2011-08-08T20:41:59","guid":{"rendered":"https:\/\/scottaaronson.blog\/?p=735"},"modified":"2016-12-10T04:36:58","modified_gmt":"2016-12-10T09:36:58","slug":"why-philosophers-should-care-about-computational-complexity","status":"publish","type":"post","link":"https:\/\/scottaaronson.blog\/?p=735","title":{"rendered":"Why Philosophers Should Care About Computational Complexity"},"content":{"rendered":"<p><span style=\"color: #ff0000;\"><strong>Update (August 11, 2011):<\/strong><\/span> Thanks to everyone who offered useful feedback!\u00a0 I uploaded a slightly-revised version, adding a &#8220;note of humility&#8221; to the introduction, correcting the footnote about Cramer&#8217;s Conjecture, incorporating Gil Kalai&#8217;s point that an efficient program to pass the Turing Test could <em>exist<\/em> but be computationally intractable to <em>find<\/em>, adding some more references, and starting the statement of Valiant&#8217;s sample-size theorem with the word &#8220;Consider&#8230;&#8221; instead of &#8220;Fix&#8230;&#8221;<\/p>\n<hr \/>\n<p>I just <a href=\"http:\/\/eccc.hpi-web.de\/report\/2011\/108\/\">posted a 53-page essay of that name<\/a> to ECCC; it&#8217;s what I was writing pretty much nonstop for the last two months.\u00a0 The essay will appear in a volume entitled &#8220;Computability: G\u00f6del, Turing, Church, and beyond,&#8221; which MIT Press will be publishing next year (to coincide with Alan T.&#8217;s hundredth birthday).<\/p>\n<p>Note that, to explain why philosophers should care about computational complexity, I also had to touch on the related questions of why <em>anyone<\/em> should care about computational complexity, and why computational complexity theorists should care about philosophy.\u00a0 Anyway, here&#8217;s the abstract:<\/p>\n<p style=\"padding-left: 30px;\">One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance.\u00a0 In this essay, I offer a detailed case that one would be wrong.\u00a0 In particular, I argue that computational complexity theory&#8212;the field that studies the resources (such as time, space, and randomness) needed to solve computational problems&#8212;leads to new perspectives on the nature of mathematical knowledge, the strong AI debate, computationalism, the problem of logical omniscience, Hume&#8217;s problem of induction and Goodman&#8217;s grue riddle, the foundations of quantum mechanics, economic rationality, closed timelike curves, and several other topics of philosophical interest.\u00a0 I end by discussing aspects of complexity theory itself that could benefit from philosophical analysis.<\/p>\n<p>Weighing in with 70 footnotes and 126 references, the essay is basically a huge, sprawling mess; I hope that at least some of you will enjoy getting lost in it.\u00a0 I&#8217;d like to thank my editor, Oron Shagrir, for kicking me for more than a year until I finally wrote this thing.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Update (August 11, 2011): Thanks to everyone who offered useful feedback!\u00a0 I uploaded a slightly-revised version, adding a &#8220;note of humility&#8221; to the introduction, correcting the footnote about Cramer&#8217;s Conjecture, incorporating Gil Kalai&#8217;s point that an efficient program to pass the Turing Test could exist but be computationally intractable to find, adding some more references, [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"advanced_seo_description":"","jetpack_seo_html_title":"","jetpack_seo_noindex":false,"jetpack_seo_schema_type":"","_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_hide_featured_image":false,"_jetpack_featured_image_duplicate_dismissed":0,"_jetpack_feature_clip_id":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"{title}\n\n{excerpt}\n\n{url}","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2},"_wpas_customize_per_network":false,"jetpack_post_was_ever_published":false},"categories":[5,12,4],"tags":[],"class_list":["post-735","post","type-post","status-publish","format-standard","hentry","category-complexity","category-metaphysical-spouting","category-quantum"],"jetpack_publicize_connections":[],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/posts\/735","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=735"}],"version-history":[{"count":4,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/posts\/735\/revisions"}],"predecessor-version":[{"id":3017,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/posts\/735\/revisions\/3017"}],"wp:attachment":[{"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=735"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=735"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=735"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}