Determination of the Fifth Busy Beaver Value
Authors:
- Justin BlanchardJBJustin Blanchard
- Daniel BriggsDBDaniel Briggs
- Konrad DekaKDKonrad Deka
- Nathan FennerNFNathan Fenner
- Yannick ForsterYFYannick Forster
- Georgi Georgiev (Skelet)G(Georgi Georgiev (Skelet)
- Matthew L. HouseMHMatthew L. House
- Maja KądziołkaMKMaja Kądziołka
- Pavel KropitzPKPavel Kropitz
- Shawn LigockiSLShawn Ligocki
- MxdysMXMxdys
- Mateusz NaściszewskiMNMateusz Naściszewski
Open Access
- 9 June 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 565-574
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Hardness of Busy Beaver Value BB(15)2024
- The Lean Theorem Prover (System Description)2015
- A Machine-Checked Proof of the Odd Order Theorem2013
- Full Reduction at Full Throttle2011
- Small Turing machines and generalized busy beaver competitionTheoretical Computer Science, 2004
- Using reflection to build efficient and certified decision procedures1997
- A note on busy beavers and other creaturesTheory of Computing Systems, 1996
- Minimax algebra and applicationsFuzzy Sets and Systems, 1991
- A classification of the ordinal recursive functionsArchive for Mathematical Logic, 1970
- On Non-Computable FunctionsBell System Technical Journal, 1962