{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:56:15Z","timestamp":1781078175333,"version":"3.54.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031726200","type":"print"},{"value":"9783031726217","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-72621-7_9","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T07:02:34Z","timestamp":1726729354000},"page":"120-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hardness of\u00a0Busy Beaver Value BB(15)"],"prefix":"10.1007","author":[{"given":"Tristan","family":"St\u00e9rin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damien","family":"Woods","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,9,18]]},"reference":[{"key":"9_CR1","unstructured":"The Busy Beaver Challenge. https:\/\/bbchallenge.org\/. Accessed 04 Aug 2024"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/3427361.3427369","volume":"51","author":"S Aaronson","year":"2020","unstructured":"Aaronson, S.: The busy beaver frontier. SIGACT News 51(3), 32\u201354 (2020)","journal-title":"SIGACT News"},{"key":"9_CR3","unstructured":"Adamczewski, B., Faverjon, C.: Mahler\u2019s method in several variables II: applications to base change problems and finite automata (2018). https:\/\/arxiv.org\/abs\/1809.04826"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Brady, A.H.: The busy beaver game and the meaning of life. In: A Half-Century Survey on the Universal Turing Machine, pp. 259\u2013277. Oxford University Press Inc. (1988)","DOI":"10.1093\/oso\/9780198537748.003.0009"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-1-4612-4808-8_28","volume-title":"Open Problems in Communication and Computation","author":"GJ Chaitin","year":"1987","unstructured":"Chaitin, G.J.: Computing the busy beaver function. In: Cover, T.M., Gopinath, B. (eds.) Open Problems in Communication and Computation, pp. 108\u2013112. Springer, New York (1987). https:\/\/doi.org\/10.1007\/978-1-4612-4808-8_28"},{"key":"9_CR6","unstructured":"Code Golf Addict: list27.txt (2016). https:\/\/gist.github.com\/anonymous\/a64213f391339236c2fe31f8749a0df6"},{"key":"9_CR7","unstructured":"Cook, M., St\u00e9rin, T., Woods, D.: Small tile sets that compute while solving mazes. In: Lakin, M., Sulc, P. (eds.) Proceedings of the 27th International Conference on DNA Computing and Molecular Programming (DNA 27). Leibniz International Proceedings in Informatics (LIPIcs), vol. 205, pp. 1\u201320. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). arxiv preprint: https:\/\/arxiv.org\/abs\/2106.12341"},{"key":"9_CR8","unstructured":"Dimitrov, V.S., Howe, E.W.: Powers of 3 with few nonzero bits and a conjecture of Erd\u0151s (2021). https:\/\/arxiv.org\/abs\/2105.06440"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.jnt.2015.05.022","volume":"158","author":"T Dupuy","year":"2016","unstructured":"Dupuy, T., Weirich, D.E.: Bits of $$3^n$$ in binary, Wieferich primes and a conjecture of Erd\u0151s. J. Number Theory 158, 268\u2013280 (2016). https:\/\/doi.org\/10.1016\/j.jnt.2015.05.022","journal-title":"J. Number Theory"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1080\/0025570X.1979.11976756","volume":"52","author":"P Erd\u0151s","year":"1979","unstructured":"Erd\u0151s, P.: Some unconventional problems in number theory. Math. Mag. 52(2), 67\u201370 (1979). https:\/\/doi.org\/10.1080\/0025570X.1979.11976756","journal-title":"Math. Mag."},{"key":"9_CR11","unstructured":"Georgiev, G.: Busy Beaver prover. https:\/\/skelet.ludost.net\/bb\/index.html. Accessed 27 May 2024"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.tcs.2022.04.040","volume":"922","author":"J Harland","year":"2022","unstructured":"Harland, J.: Generating candidate busy beaver machines (or how to build the zany zoo). Theor. Comput. Sci. 922, 368\u2013394 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.04.040","journal-title":"Theor. Comput. Sci."},{"key":"9_CR13","unstructured":"Riebel, J.: The Undecidability of BB(748). Bachelor\u2019s thesis (2023). https:\/\/www.ingo-blechschmidt.eu\/assets\/bachelor-thesis-undecidability-bb748.pdf"},{"key":"9_CR14","unstructured":"Kropitz, P.: BB(6, 2) $$>\\;4\\hat{\\,}4\\hat{\\,}4\\hat{\\,}4\\hat{\\,}7$$ (2022). https:\/\/groups.google.com\/g\/busy-beaver-discuss\/c\/-zjeW6y8ER4\/m\/ZBuLvbVOAgAJ"},{"key":"9_CR15","unstructured":"Kropitz, P.: BB(2, 6) $$>\\; 10\\uparrow \\uparrow {10}\\uparrow \\uparrow {10}\\uparrow \\uparrow 3$$ (2023). https:\/\/groups.google.com\/g\/busy-beaver-discuss\/c\/UuC_Yjc5LPQ"},{"key":"9_CR16","unstructured":"Kropitz, P.: BB(3, 4) $$>$$ Ack(14) (2024). https:\/\/groups.google.com\/g\/busy-beaver-discuss\/c\/dkecbR5b5Og\/"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Lagarias, J.C.: Ternary expansions of powers of 2. J. Lond. Math. Soc. (2) 79(3), 562\u2013588 (2009). https:\/\/doi.org\/10.1112\/jlms\/jdn080","DOI":"10.1112\/jlms\/jdn080"},{"key":"9_CR18","unstructured":"Ligocki, S.: BB(3, 4) $$>$$ Ack(14) (2024). https:\/\/www.sligocki.com\/2024\/05\/22\/bb-3-4-a14.html"},{"key":"9_CR19","first-page":"247","volume":"40","author":"H Marxen","year":"1990","unstructured":"Marxen, H., Buntrock, J.: Attacking the busy beaver 5. Bull. EATCS 40, 247\u2013251 (1990)","journal-title":"Bull. EATCS"},{"key":"9_CR20","unstructured":"Michel, P.: The Busy Beaver Competitions. https:\/\/bbchallenge.org\/~pascal.michel\/bbc.html. Accessed 04 Aug 2024"},{"key":"9_CR21","unstructured":"Michel, P.: Simulation of the Collatz 3x+1 function by Turing machines. Technical report (2014). arXiv preprint https:\/\/arxiv.org\/abs\/1409.7322"},{"key":"9_CR22","unstructured":"Michel, P.: The busy beaver competition: a historical survey. Technical report (2019). https:\/\/arxiv.org\/abs\/0906.3749v6"},{"issue":"1","key":"9_CR23","first-page":"123","volume":"91","author":"T Neary","year":"2009","unstructured":"Neary, T., Woods, D.: Four small universal Turing machines. Fund. Inform. 91(1), 123\u2013144 (2009)","journal-title":"Fund. Inform."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Rad\u00f3, T.: On non-computable functions. Bell Syst. Tech. J. 41(3), 877\u2013884 (1962). https:\/\/archive.org\/details\/bstj41-3-877\/mode\/2up","DOI":"10.1002\/j.1538-7305.1962.tb00480.x"},{"key":"9_CR25","unstructured":"Ridenour, R.: (2024). https:\/\/github.com\/CatsAreFluffy\/metamath-turing-machines"},{"issue":"2","key":"9_CR26","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(96)00077-1","volume":"168","author":"Y Rogozhin","year":"1996","unstructured":"Rogozhin, Y.: Small universal Turing machines. Theor. Comput. Sci. 168(2), 215\u2013240 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR27","unstructured":"St\u00e9rin, T.: Six tiles: from Collatz sequences to algorithmic DNA origami. Ph.D. thesis, Maynooth University (2023)"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-030-61739-4_9","volume-title":"Reachability Problems","author":"T St\u00e9rin","year":"2020","unstructured":"St\u00e9rin, T., Woods, D.: The Collatz process embeds a base conversion algorithm. In: Schmitz, S., Potapov, I. (eds.) RP 2020. LNCS, vol. 12448, pp. 131\u2013147. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61739-4_9"},{"key":"9_CR29","unstructured":"Tao, T.: The Collatz conjecture, Littlewood-Offord theory, and powers of\u00a02 and\u00a03. https:\/\/terrytao.wordpress.com\/2011\/08\/25\/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3\/. Accessed 30 June 2021"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Woods, D., Neary, T.: On the time complexity of 2-tag systems and small universal Turing machines. In: In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Berkeley, California, pp. 132\u2013143. IEEE (2006)","DOI":"10.1109\/FOCS.2006.58"},{"issue":"4\u20135","key":"9_CR31","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.tcs.2008.09.051","volume":"410","author":"D Woods","year":"2009","unstructured":"Woods, D., Neary, T.: The complexity of small universal Turing machines: a survey. Theor. Comput. Sci. 410(4\u20135), 443\u2013450 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9_CR32","doi-asserted-by":"publisher","first-page":"297","DOI":"10.25088\/complexsystems.25.4.297","volume":"25","author":"A Yedidia","year":"2016","unstructured":"Yedidia, A., Aaronson, S.: A relatively small Turing machine whose behavior is independent of set theory. Complex Syst. 25(4), 297\u2013328 (2016). https:\/\/doi.org\/10.25088\/complexsystems.25.4.297","journal-title":"Complex Syst."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-72621-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T07:06:57Z","timestamp":1726729617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-72621-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031726200","9783031726217"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-72621-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"18 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easychair.org\/smart-program\/RP24\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}