研究者发现了一台10状态图灵机n1，其停止时在纸带上写下的1的数量超过了格拉汉姆数，突破了BB(10)的现有纪录1。该机器的性能被证明达到快速增长层级的ω+1级，而当前BB(10)冠军仅为ω级1。这一发现于2026年10月8日公布1。
n1机器的得分介于f_(ω+1)((3T−13)/7 − 2)和f_(ω+1)(6T)之间，其ones值超过格拉汉姆数g_64，因为g_64 < f_(ω+1)(64) < ones1。机器基于BB(7)冠军和BB(8)记录，通过改写E0转移和添加I、J两个状态实现1。整个证明已在Coq形式化验证系统8.20.1版本中完成，包含12个主要定理1。
Researchers have discovered a new 10-state Turing machine, designated n1, that produces a score surpassing Graham's number when it halts.1 The machine writes a quantity of ones on its tape that falls between f_(ω+1)((3T−13)/7 − 2) and f_(ω+1)(6T), where the lower bound already exceeds g_64 (Graham's number) according to the proof that g_64 < f_(ω+1)(64) < ones.1 This achievement represents a breakthrough in the busy beaver function BB(10), as the current champion machine operates at the ω level of the fast-growing hierarchy, while n1 reaches ω+1.1
The machine configuration is specified as 1RB0RA_1LC1LF_1RD0LB_1RA1LE_1LI0LC_0RG1LD_1RH1LG_1LC0RG_0LJ0LI_1RZ0LC and was discovered on October 8, 2026.1 The design builds upon the BB(7) champion identified by Kropitz in 2025 and the BB(8) record established by Ketchersid in 2026, modified through rewriting of E0 transitions and the addition of two new states, I and J.1 The complete proof has been formally verified in Coq version 8.20.1, encompassing twelve principal theorems and confirmed as closed under the global context.1
评论
还没有评论，欢迎留下第一条。