Blanking Busy Beaver Function: Difference between revisions
Jump to navigation
Jump to search
(Made a general note about 1-state BLB champions being nonexistent) |
(Added see also section with a link to BLBi) |
||
| Line 40: | Line 40: | ||
|{{TM|1RB2RA1RA2RB_2LB3LA0RB0RA}} | |{{TM|1RB2RA1RA2RB_2LB3LA0RB0RA}} | ||
|} | |} | ||
==See also== | |||
* [[Instruction-Limited Busy Beaver#Instruction-Limited Busy Beaver Variants|Instruction-Limited Blanking Busy Beaver]] | |||
==References== | ==References== | ||
[[Category:Functions]] | [[Category:Functions]] | ||
Latest revision as of 11:54, 28 August 2025
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.
Champions
| 2 Symbols: | Steps | Champions |
|---|---|---|
| BLB(2) | [1] | 1RB0RA_1LB1LA (bbch)
|
| BLB(3) | [2] | 1RB1LB_1LA1LC_1RC0LC (bbch)
|
| BLB(4) | 1RB1LD_1RC1RB_1LC1LA_0RC0RD (bbch)
|
| 3 Symbols: | Steps | Champions |
|---|---|---|
| BLB(2,3) | [2] | 1RB2LA0RB_1LA0LB1RA (bbch)
|
| 4 Symbols: | Steps | Champions |
|---|---|---|
| BLB(2,4) | [2] | 1RB2RA1RA2RB_2LB3LA0RB0RA (bbch)
|
See also
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.