{"id":"https://openalex.org/W7225196180","doi":"https://doi.org/10.5281/zenodo.23909959","title":"Busy Beaver Dominates All Computable Functions, Proving a Hard Limit on Formal Systems \u2014 E8 Intelligence Research","display_name":"Busy Beaver Dominates All Computable Functions, Proving a Hard Limit on Formal Systems \u2014 E8 Intelligence Research","publication_year":2026,"publication_date":"2026-11-03","ids":{"openalex":"https://openalex.org/W7225196180","doi":"https://doi.org/10.5281/zenodo.23909959"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.23909959","doi":"https://doi.org/10.5281/zenodo.23909959","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23909959","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"volume":null,"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.23909959","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5152673107","display_name":"Andrew Stewart Caldin","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Caldin, Andrew Stewart","raw_affiliation_strings":["Independent Researcher, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Independent Researcher, United Kingdom","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5152673107"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/busy-beaver-function","display_name":"Busy Beaver function","score":0.9779999852180481},{"id":"https://openalex.org/keywords/uncomputability","display_name":"uncomputability","score":0.8040000200271606},{"id":"https://openalex.org/keywords/matrix-diagonalization","display_name":"diagonalization","score":0.6639999747276306},{"id":"https://openalex.org/keywords/recursive-functions","display_name":"recursive functions","score":0.8199999928474426},{"id":"https://openalex.org/keywords/turing-machines","display_name":"Turing machines","score":0.8809999823570251},{"id":"https://openalex.org/keywords/limits-of-formal-systems","display_name":"limits of formal systems","score":0.7269999980926514},{"id":"https://openalex.org/keywords/primitive-recursive-functions","display_name":"primitive recursive functions","score":0.7009999752044678},{"id":"https://openalex.org/keywords/growth-rate","display_name":"growth rate","score":0.6060000061988831}],"concepts":[{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.5843999981880188},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5382999777793884},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5302000045776367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4902999997138977},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.48989999294281006},{"id":"https://openalex.org/C156382255","wikidata":"https://www.wikidata.org/wiki/Q818895","display_name":"Computable number","level":4,"score":0.4731999933719635},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.4388999938964844},{"id":"https://openalex.org/C27318111","wikidata":"https://www.wikidata.org/wiki/Q5157264","display_name":"Computable analysis","level":3,"score":0.43720000982284546},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4302999973297119},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4122999906539917},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39989998936653137},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.38909998536109924},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3671000003814697},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.33379998803138733},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3325999975204468},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.32100000977516174},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30720001459121704},{"id":"https://openalex.org/C102315432","wikidata":"https://www.wikidata.org/wiki/Q649732","display_name":"Formal system","level":2,"score":0.3059000074863434},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.29120001196861267},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C2779524503","wikidata":"https://www.wikidata.org/wiki/Q47542","display_name":"Beaver","level":2,"score":0.2806999981403351},{"id":"https://openalex.org/C47884741","wikidata":"https://www.wikidata.org/wiki/Q1166618","display_name":"Mathematical logic","level":2,"score":0.2761000096797943},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C151913843","wikidata":"https://www.wikidata.org/wiki/Q3454555","display_name":"Dominance (genetics)","level":3,"score":0.26409998536109924},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.260699987411499}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5281/zenodo.23909959","doi":"https://doi.org/10.5281/zenodo.23909959","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23909959","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.5281/zenodo.23909960","doi":"https://doi.org/10.5281/zenodo.23909960","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23909960","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.5281/zenodo.23909959","doi":"https://doi.org/10.5281/zenodo.23909959","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23909959","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7202247943","https://openalex.org/W7224994607","https://openalex.org/W7212448504","https://openalex.org/W7208739465","https://openalex.org/W7204945643","https://openalex.org/W7211936312","https://openalex.org/W7210289023","https://openalex.org/W7202243017","https://openalex.org/W7223394714","https://openalex.org/W7223789228"],"abstract_inverted_index":{"FINDING:":[0],"The":[1],"Busy":[2],"Beaver":[3],"function":[4,15,73],"BB(n)":[5,38,57,84,121,156],"is":[6,19,58,157],"total,":[7],"well-defined,":[8],"and":[9,106],"strictly":[10],"dominates":[11],"every":[12,76],"total":[13,59,77],"computable":[14,72,78],"\u2014":[16,108],"its":[17],"uncomputability":[18],"proven":[20],"by":[21,43],"diagonalization,":[22],"establishing":[23],"a":[24],"hard":[25],"ceiling":[26],"on":[27,51],"what":[28],"any":[29,44,71],"finite":[30],"formal":[31],"system":[32],"can":[33],"decide.":[34],"MATH:":[35],"-":[36,55,87,132,148],"Definition:":[37],"=":[39,120],"max{":[40],"steps":[41],"halted":[42],"n-state":[45],"2-symbol":[46],"Turing":[47],"machine":[48,96],"that":[49,82],"halts":[50,107],"blank":[52],"input":[53],"}.":[54],"Growth:":[56],"(defined":[60],"for":[61,75],"all":[62,152],"n)":[63],"but":[64],"not":[65,158],"computable.":[66,93],"It":[67],"grows":[68],"faster":[69],"than":[70],"f:":[74],"f,":[79],"\u2203N":[80],"such":[81],"\u2200n>N,":[83],">":[85,143],"f(n).":[86,117],"Dominance":[88],"proof":[89],"(diagonalization):":[90],"Assume":[91],"BB":[92,127],"Then":[94,112],"construct":[95],"M_f":[97],"that,":[98],"given":[99],"n,":[100],"computes":[101],"f(n),":[102],"writes":[103],"f(n)":[104,119],"ones,":[105],"using":[109],"c":[110],"states.":[111],"BB(n":[113],"+":[114,122],"c)":[115],"\u2265":[116],"Choose":[118],"1":[123],"\u2192":[124],"contradiction.":[125],"Hence":[126],"\u2209":[128],"R":[129],"(computable":[130],"functions).":[131],"Known":[133],"values:":[134],"BB(1)=1,":[135],"BB(2)=4,":[136],"BB(3)=6,":[137],"BB(4)=13,":[138],"BB(5)=47,176,870":[139],"(Cooper\u2013Kropitz":[140],"2024),":[141],"BB(6)":[142],"10\u2191\u219115":[144],"(lower":[145],"bound,":[146],"2022).":[147],"Growth":[149],"rate":[150],"exceeds":[151],"primitive":[153],"recursive":[154],"functions;":[155],"dom":[159],"Author:":[160],"Andrew":[161],"Stewart":[162],"Caldin,":[163],"Independent":[164],"Researcher,":[165],"UK.":[166],"Part":[167],"of":[168],"the":[169],"E8":[170],"Intelligence":[171],"Research":[172],"series.":[173],"Platform:":[174],"e8intelligence.com":[175]},"counts_by_year":[],"updated_date":"2026-11-05T12:25:35.769452","created_date":"2026-11-04T00:00:00"}