{"id":2195,"date":"2009-12-01T06:04:39","date_gmt":"2009-12-01T11:04:39","guid":{"rendered":"http:\/\/www.webliminal.com\/webliminalblog\/?p=2195"},"modified":"2009-12-07T07:06:49","modified_gmt":"2009-12-07T12:06:49","slug":"links-for-2009-12-01","status":"publish","type":"post","link":"https:\/\/www.webliminal.com\/webliminalblog\/interesting-web-sites\/links-for-2009-12-01","title":{"rendered":"links for 2009-12-01"},"content":{"rendered":"<p><a href=\"http:\/\/webliminal.com\/images\/sidepics\/sp201.jpg\"><img decoding=\"async\" class=\"alignleft\" style=\"margin-left: 22px; margin-right: 22px;\" src=\"http:\/\/webliminal.com\/images\/sidepics\/cwdata\/sp201.jpg\" alt=\"Columbine in the front garden, home, Falmouth, Va\" align=\"left\" \/><\/a><\/p>\n<ul class=\"delicious\">\n<li>\n<div class=\"delicious-link\"><a href=\"http:\/\/www.pling.org.uk\/cs\/toc.html\">Theory of Computation<\/a><\/div>\n<div class=\"delicious-extended\">overview of theory of computation<\/div>\n<div class=\"delicious-tags\">(tags: <a href=\"http:\/\/delicious.com\/ernestackermann\/theoretical\">theoretical<\/a> <a href=\"http:\/\/delicious.com\/ernestackermann\/computation\">computation<\/a> <a href=\"http:\/\/delicious.com\/ernestackermann\/computerscience\">computerscience<\/a> <a href=\"http:\/\/delicious.com\/ernestackermann\/theory\">theory<\/a> <a href=\"http:\/\/delicious.com\/ernestackermann\/overview\">overview<\/a>)<\/div>\n<\/li>\n<li>\n<div class=\"delicious-link\"><a href=\"http:\/\/www.scottaaronson.com\/talks\/anthropic.html\">Computational Complexity and the Anthropic Principle<\/a><\/div>\n<div class=\"delicious-extended\">&#8220;What I want to do today is step back from the details of the string-theory Landscape, and tell you what&#8217;s known about the general problem of searching a landscape for a point with specified properties. In particular, is this problem solvable in a reasonable amount of time using the resources of the physical universe? And if, as many of us think, the answer is no, then what are the implications for physics?&#8221;<\/div>\n<div class=\"delicious-tags\">(tags: <a href=\"http:\/\/delicious.com\/ernestackermann\/physics\">physics<\/a> <a href=\"http:\/\/delicious.com\/ernestackermann\/anthropic\">anthropic<\/a> <a href=\"http:\/\/delicious.com\/ernestackermann\/quantum\">quantum<\/a> <a href=\"http:\/\/delicious.com\/ernestackermann\/complexity-theory\">complexity-theory<\/a> <a href=\"http:\/\/delicious.com\/ernestackermann\/computerscience\">computerscience<\/a> <a href=\"http:\/\/delicious.com\/ernestackermann\/complexity\">complexity<\/a>)<\/div>\n<\/li>\n<\/ul>\n<!-- AddThis Advanced Settings generic via filter on the_content --><!-- AddThis Share Buttons generic via filter on the_content -->","protected":false},"excerpt":{"rendered":"<p>Theory of Computation overview of theory of computation (tags: theoretical computation computerscience theory overview) Computational Complexity and the Anthropic Principle &#8220;What I want to do today is step back from the details of the string-theory Landscape, and tell you what&#8217;s known about the general problem of searching a landscape for a point with specified properties. [&hellip;]<!-- AddThis Advanced Settings generic via filter on get_the_excerpt --><!-- AddThis Share Buttons generic via filter on get_the_excerpt --><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[9,12],"tags":[537,538],"class_list":["post-2195","post","type-post","status-publish","format-standard","hentry","category-interesting-web-sites","category-teaching","tag-computational-complexity","tag-theoretical-computing"],"_links":{"self":[{"href":"https:\/\/www.webliminal.com\/webliminalblog\/wp-json\/wp\/v2\/posts\/2195","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.webliminal.com\/webliminalblog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.webliminal.com\/webliminalblog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.webliminal.com\/webliminalblog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.webliminal.com\/webliminalblog\/wp-json\/wp\/v2\/comments?post=2195"}],"version-history":[{"count":4,"href":"https:\/\/www.webliminal.com\/webliminalblog\/wp-json\/wp\/v2\/posts\/2195\/revisions"}],"predecessor-version":[{"id":2226,"href":"https:\/\/www.webliminal.com\/webliminalblog\/wp-json\/wp\/v2\/posts\/2195\/revisions\/2226"}],"wp:attachment":[{"href":"https:\/\/www.webliminal.com\/webliminalblog\/wp-json\/wp\/v2\/media?parent=2195"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.webliminal.com\/webliminalblog\/wp-json\/wp\/v2\/categories?post=2195"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.webliminal.com\/webliminalblog\/wp-json\/wp\/v2\/tags?post=2195"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}