Blanking Busy Beaver Function: Difference between revisions
Jump to navigation
Jump to search
(Created page for the Blanking Busy Beaver Function) |
(Added see also section with a link to BLBi) |
||
| (4 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
The '''Blanking Busy Beaver Function''' (BLB(n,m)) is a [[Busy Beaver Functions|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. | The '''Blanking Busy Beaver Function''' (BLB(n,m)) is a [[Busy Beaver Functions|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== | ==Champions== | ||
{| class="wikitable" | |||
|+ | |||
!'''2 Symbols:''' | |||
!Steps | |||
!Champions | |||
|- | |||
|BLB(2) | |||
|<math>\geq 8</math><ref name=":3">Nick Drozd. "[https://nickdrozd.github.io/2021/02/14/blanking-beavers.html Blanking Beavers]". Accessed 15 August 2025.</ref> | |||
|{{TM|1RB0RA_1LB1LA}} | |||
|- | |||
|BLB(3) | |||
|<math>\geq 34</math><ref name=":4">Nick Drozd. "[https://nickdrozd.github.io/2022/02/11/latest-beeping-busy-beaver-results.html Latest Beeping Busy Beaver Results]". Accessed 15 August 2025.</ref> | |||
|{{TM|1RB1LB_1LA1LC_1RC0LC}} | |||
|- | |||
|BLB(4) | |||
|<math>\geq 32\,779\,477</math> | |||
|{{TM|1RB1LD_1RC1RB_1LC1LA_0RC0RD}} | |||
|} | |||
{| class="wikitable" | |||
|+ | |||
!'''3 Symbols:''' | |||
!Steps | |||
!Champions | |||
|- | |||
|BLB(2,3) | |||
|<math>\geq 77</math><ref name=":4" /> | |||
|{{TM|1RB2LA0RB_1LA0LB1RA}} | |||
|} | |||
{| class="wikitable" | |||
|+ | |||
!'''4 Symbols:''' | |||
!Steps | |||
!Champions | |||
|- | |||
|BLB(2,4) | |||
|<math>\geq 1\,367\,361\,263\,049</math><ref name=":4" /> | |||
|{{TM|1RB2RA1RA2RB_2LB3LA0RB0RA}} | |||
|} | |||
==See also== | |||
* [[Instruction-Limited Busy Beaver#Instruction-Limited Busy Beaver Variants|Instruction-Limited Blanking Busy Beaver]] | |||
==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.