Blanking Beaver: Difference between revisions
→Champions: Better BLB(5) champion |
→Champions: added BLB(2,5) |
||
| Line 55: | Line 55: | ||
|≥ 1,367,361,263,049<ref name=":4" /> | |≥ 1,367,361,263,049<ref name=":4" /> | ||
|{{TM|1RB2RA1RA2RB_2LB3LA0RB0RA}} | |{{TM|1RB2RA1RA2RB_2LB3LA0RB0RA}} | ||
|} | |||
{| class="wikitable" | |||
|+ | |||
!'''5 Symbols:''' | |||
!Steps | |||
!Champions | |||
|- | |||
|BLB(2,5) | |||
|≥ 166,524,066,023,572,459<ref>https://discord.com/channels/960643023006490684/1385498968011575366/1502708661259206798</ref> | |||
|{{TM|1RB2RB3LA2RA3RA_2LB1LA0RB4RA4LA}} | |||
|} | |} | ||
Revision as of 16:40, 13 May 2026
The Blanking Busy Beaver Function (BLB(n,m)) is a Busy Beaver Function which measures the largest amount of steps done by any Turing machine with n states and m symbols before blanking the tape. Blanking Busy Beaver machines are allowed to be halting or non-halting. As machines with just a single state cannot blank the tape, BLB(1,m) is nonexistent for any amount of symbols m. Similarly, BLB(n,1) is nonexistent for any amount of states n, as the tape of 1-symbol machines is always blank.
Champions
| 2 Symbols: | Steps | Champions |
|---|---|---|
| BLB(2) | 8[1] | 1RB0RA_1LB1LA (bbch)
|
| BLB(3) | ≥ 34[2] | 1RB1LB_1LA1LC_1RC0LC (bbch)
|
| BLB(4) | ≥ 32,779,477 | 1RB1LD_1RC1RB_1LC1LA_0RC0RD (bbch)
|
| BLB(5) | ≥ 455,790,469,746[3][4] | 1RB---_0RC1RB_1LC1LD_1RE0RD_0LE0RB (bbch)
|
| BLB(6) | ||
| BLB(7) | > 10^183.76332[5] | 1RB0RF_1RC1RA_1LD0LA_0RG0RE_0RA1LF_0LE0LC_1RZ0RD (bbch)
|
| 3 Symbols: | Steps | Champions |
|---|---|---|
| BLB(2,3) | ≥ 77[2] | 1RB2LA0RB_1LA0LB1RA (bbch)
|
| BLB(3,3) | > 1042,745 | 1RB2RB1LA_2LC0LB2LB_2RC2RA0LC (bbch)
|
| 4 Symbols: | Steps | Champions |
|---|---|---|
| BLB(2,4) | ≥ 1,367,361,263,049[2] | 1RB2RA1RA2RB_2LB3LA0RB0RA (bbch)
|
| 5 Symbols: | Steps | Champions |
|---|---|---|
| BLB(2,5) | ≥ 166,524,066,023,572,459[6] | 1RB2RB3LA2RA3RA_2LB1LA0RB4RA4LA (bbch)
|
Instruction-limited Blanking Busy Beaver (BLBi(n))
BLBi(n) is the largest amount of steps taken by an n-instruction Turing machine when blanking the tape for the first time after having written a non-blank symbol on the tape.
Champions
Note that BLBi(1) and BLBi(2) are nonexistent as Turing machines with one or two instructions cannot blank the tape.
| Instructions | Steps | Champions |
|---|---|---|
| BLBi(3) | 4 | 1RB0RA_1LA--- (bbch)
|
| BLBi(4) | 12 | 1RB---_1RC---_1LC0RC (bbch)
|
| BLBi(5) | 30 | 1RB------_1RC------_2LC2RC0RC (bbch)
|
| BLBi(6) | 77 | 1RB2LA0RB_1LA0LB1RA (bbch)
|
| BLBi(7) | 808 | 1RB------_1RC------_0RD2LC---_1LD2RD0RC (bbch)
|
| BLBi(8) | ≥ 1,367,361,263,049 | 1RB2RA1RA2RB_2LB3LA0RB0RA (bbch)
|
| BLBi(9) | > 1042,745 | 1RB2RB1LA_2LC0LB2LB_2RC2RA0LC (bbch)
|
References
- ↑ Nick Drozd. "Blanking Beavers". Accessed 15 August 2025.
- ↑ 2.0 2.1 2.2 Nick Drozd. "Latest Beeping Busy Beaver Results". Accessed 15 August 2025.
- ↑ https://discord.com/channels/960643023006490684/1243312334907375676/1504155813957079242
- ↑ https://discord.com/channels/960643023006490684/1026577255754903572/1034525523864457276
- ↑ https://discord.com/channels/960643023006490684/1369339127652159509/1374531970830307409
- ↑ https://discord.com/channels/960643023006490684/1385498968011575366/1502708661259206798