User:RobinCodes/Work on BB Domains: Difference between revisions
RobinCodes (talk | contribs) Added fuller table; much better color-coding |
RobinCodes (talk | contribs) mNo edit summary |
||
| Line 28: | Line 28: | ||
[[BB(7)]] | [[BB(7)]] | ||
| style="background: #AA8519;" |Expected no. of holdouts: 147 billion (<math>1.47 \cdot 10^{11}</math>) | | style="background: #AA8519;" |Expected no. of holdouts: 147 billion (<math>1.47 \cdot 10^{11}</math>) | ||
[[BB(8)]] | |||
|- | |- | ||
! 3-symbol | ! 3-symbol | ||
| Line 117: | Line 118: | ||
|- | |- | ||
!8-symbol | !8-symbol | ||
| style="background: #ECC652;" | | | style="background: #ECC652;" |Expected no. of holdouts: 5.51 trillion (<math display="inline">5.51 \cdot 10^{12}</math>) | ||
[[BB(2,8)]] | |||
| style="background: #A8973E;" | | | style="background: #A8973E;" | | ||
| style="background: #A8973E;" | | | style="background: #A8973E;" | | ||
| Line 127: | Line 129: | ||
Futher domains with small information: | Futher domains with small information: | ||
* [[BB(11)]]: Lower bound: (Racheline 2024) | * [[BB(11)]]: Lower bound: (Racheline 2024) | ||
<math display="block">f_\omega^2(2 \uparrow\uparrow 12)</math> | <math display="block">f_\omega^2(2 \uparrow\uparrow 12)</math> | ||
| Line 133: | Line 134: | ||
* [[BB(12)]]: Lower bound: (Racheline 2024) | * [[BB(12)]]: Lower bound: (Racheline 2024) | ||
<math display="block">f_\omega^4(2 \uparrow\uparrow\uparrow 4-3)</math> | <math display="block">f_\omega^4(2 \uparrow\uparrow\uparrow 4-3)</math> | ||
== Enumeration == | == Enumeration == | ||
The enumeration process for [[BB(2,7)]] has started, and 5% has so far been completed. [[BB(8)]] is (tested from a random sample) even harder to enumerate. These processes will take a very long time and much collaborative work to complete. As for BB(3x5), BB(4x4), BB(5x3), enumeration may still be possible, but also incredibly difficult. Any domains after these are probably complete out-of-reach of current technology, just to enumerate. Using crowdsourced enumeration, one more layer may be possible. | The enumeration process for [[BB(2,7)]] has started, and 5% has so far been completed. [[BB(8)]] is (tested from a random sample) even harder to enumerate. These processes will take a very long time and much collaborative work to complete. As for BB(3x5), BB(4x4), BB(5x3), enumeration may still be possible, but also incredibly difficult. Any domains after these are probably complete out-of-reach of current technology, just to enumerate. Using crowdsourced enumeration, one more layer may be possible. | ||
Revision as of 10:08, 1 April 2026
Progress
As of 1 April 2026,
Domains with active filtering going on (decider-wise): BB(2,6), BB(7) - Andrew Ducharme
| 2-state | 3-state | 4-state | 5-state | 6-state | 7-state | 8-state | |
|---|---|---|---|---|---|---|---|
| 2-symbol | BB(2) = 6 | BB(3) = 21 | BB(4) = 107 | BB(5) = 47,176,870
2 Jul 2024 |
1161
Holdouts list 16+6 Cryptids |
18,036,852
No Handwork Andrew Ducharme, Terry Ligocki Phase 2, Stage 6 |
Expected no. of holdouts: 147 billion () |
| 3-symbol | BB(2,3) = 38 | 4
1 Cryptid, Exhausted |
9,401,447
No Handwork Terry Ligocki Phase 2, Stage 2 |
||||
| 4-symbol | BB(2,4) = 3,932,964 | 12,435,284
No Handwork Phase 2, Stage 10C |
Expected no. of holdouts: 1.53 quadrillion () | ||||
| 5-symbol | 60
Holdouts list (9 informal) 2+4 Cryptids |
Lower bound: (due Racheline 2024)
Expected no. of holdouts: 11.3 trillion () BB(3,5) |
|||||
| 6-symbol | 545,005
No Handwork Andrew Ducharme, Terry Ligocki Phase 2 Stage 4 |
||||||
| 7-symbol | Enumeration started!
09xxx done (10/100) Expected no. of holdouts: 3 billion () Current: 300 million |
||||||
| 8-symbol | Expected no. of holdouts: 5.51 trillion () |
Futher domains with small information:
- BB(11): Lower bound: (Racheline 2024)
- BB(12): Lower bound: (Racheline 2024)
Enumeration
The enumeration process for BB(2,7) has started, and 5% has so far been completed. BB(8) is (tested from a random sample) even harder to enumerate. These processes will take a very long time and much collaborative work to complete. As for BB(3x5), BB(4x4), BB(5x3), enumeration may still be possible, but also incredibly difficult. Any domains after these are probably complete out-of-reach of current technology, just to enumerate. Using crowdsourced enumeration, one more layer may be possible.
Informal Proofs
Unconfirmed, informal proofs of machines for each domain by equivalence class: 11 total
| Domain | 2-state | 3-state | 4-state | 5-state | 6-state |
|---|---|---|---|---|---|
| 2-symbol | 0 | 0 | 0 | 0 | 2 |
| 3-symbol | 0 | 0 | ---- | --- | --- |
| 4-symbol | 0 | --- | --- | --- | --- |
| 5-symbol | 9 | --- | --- | --- | --- |
BB(6): 1 March 2026
1 informal, 1 unverified
- Likely correct: (2)
Shawn, star, Pomme, @mxdys: BMO 7 verified- mxdys, Pomme, Autumn Pan, vyx[1][2][3][4]:
1RB1LA_1RC1RE_1LD0RB_1LA0LC_0RF0RD_0RB--- - 1RB0RC_0LC0LB_0LD1LC_0LE1LA_0LF---_1RF1RA (halt, Racheline, informal)
BB(3,3): 28 March 2026
None
BB(2,5): 28 March 2026
7 informal, 2 unverified (6 informal, 1 unverified by eqv. class)
- Dyuan:
- BMO 3 (2 machines in 1 eqv. class) (source)
- Dekaheptoid, unverified: 1RB3RB1LB---2RB_2LA1RA4LB2LA2RA (source), equivalently 1RB3RA2LB1LB1RB_2LA2RA4LA1LA---
- BMO 3 variant: 1RB0RA3LA4LA2RA_2LB3LA---4RA3RB (source)
- Legion:
- Racheline: 1RB2LB---4LB0RB_1LA3RB4RB4RA1LB
|}