{"id":46,"date":"2006-01-08T19:35:00","date_gmt":"2006-01-08T19:35:00","guid":{"rendered":"https:\/\/scottaaronson.blog\/?p=46"},"modified":"2006-01-08T19:35:00","modified_gmt":"2006-01-08T19:35:00","slug":"im-asking-cause-i-want-to-know","status":"publish","type":"post","link":"https:\/\/scottaaronson.blog\/?p=46","title":{"rendered":"I&#8217;m asking &#8217;cause I want to know"},"content":{"rendered":"<p>Is there an algorithm to decide whether the n<sup>th<\/sup> Busy Beaver number is even or odd?  Or is this problem r.e.-complete?  Or might it have intermediate Turing degree?<\/p>\n<p>(For readers with social lives: &#8220;Busy Beaver&#8221; is not what you think.  As discussed in <a href=\"http:\/\/en.wikipedia.org\/wiki\/Busy_beaver\">this<\/a> Wikipedia article and <a href=\"http:\/\/www.scottaaronson.com\/writings\/bignumbers.html\">this<\/a> old essay of mine, it&#8217;s the maximum number of 1&#8217;s that an n-state, 2-symbol Turing machine could write on an initially blank tape before halting.)<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Is there an algorithm to decide whether the nth Busy Beaver number is even or odd? Or is this problem r.e.-complete? Or might it have intermediate Turing degree? (For readers with social lives: &#8220;Busy Beaver&#8221; is not what you think. As discussed in this Wikipedia article and this old essay of mine, it&#8217;s the maximum [&hellip;]<\/p>\n","protected":false},"author":2,"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_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],"tags":[],"class_list":["post-46","post","type-post","status-publish","format-standard","hentry","category-complexity"],"jetpack_publicize_connections":[],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/posts\/46","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\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=46"}],"version-history":[{"count":0,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/posts\/46\/revisions"}],"wp:attachment":[{"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=46"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=46"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=46"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}