BB(8): Difference between revisions
Jump to navigation
Jump to search
Added note about enumeration |
Expanded section about enumeration |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
The 8-state, 2-symbol busy beaver problem '''BB(8)''' is unsolved and largely unexplored. It is assumed that the longest running machine will | The 8-state, 2-symbol busy beaver problem '''BB(8)''' is unsolved and largely unexplored. It is assumed that the longest running machine will run for more than [[Graham's number]] steps. The current [[champion]] is the [[BB(7)]] champion {{TM|1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF|halt}} by default. | ||
In November 2025, an enumeration of a test sample of BB(8) TMs has shown the enumeration of one of the 1 million subtasks to take 7.5 hours and produce 35,000 [[holdouts]].<ref>https://discord.com/channels/960643023006490684/1084047886494470185/1441512023774199940</ref> These values are 225 times longer and 350 times larger than for BB(7). This makes BB(8) even harder to enumerate than [[BB(2,7)]]. | |||
== References == | |||
[[Category:BB Domains]] | [[Category:BB Domains]] | ||
Latest revision as of 17:33, 20 February 2026
The 8-state, 2-symbol busy beaver problem BB(8) is unsolved and largely unexplored. It is assumed that the longest running machine will run for more than Graham's number steps. The current champion is the BB(7) champion 1RB0RA_1LC1LF_1RD0LB_1RA1LE_1RZ0LC_1RG1LD_0RG0RF (bbch) by default.
In November 2025, an enumeration of a test sample of BB(8) TMs has shown the enumeration of one of the 1 million subtasks to take 7.5 hours and produce 35,000 holdouts.[1] These values are 225 times longer and 350 times larger than for BB(7). This makes BB(8) even harder to enumerate than BB(2,7).