User:Polygon/Page for testing: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
← Older edit
VisualWikitext
Polygon (talk | contribs)
1,849 edits
Added some more
Polygon (talk | contribs)
1,849 edits
Added CPS variants
 
(144 intermediate revisions by the same user not shown)
Line 1: Line 1:
Placeholder
List of incomplete pages:
{| class="wikitable"
* [[Coq-BB5]]
!Standard format
* [[Finite Automata Reduction]]
!Approximate score/runtime
* [[CTL]]
|-
* [[Irregular Turing Machine]]
|{{TM|1RB1RE_1LC1LF_1RD0LB_1LE0RC_1RA0LD_1RZ1LC}}
* [[Meet-in-the-Middle Weighted Finite Automata Reduction (MITMWFAR)]]
|10 ↑↑ 5.56344
* [[Skelet 1]]
|-
* [[CPS]] (CPS_LRU, CPS_LRUH)
|{{TM|1RB0LE_0RC1RA_0LD1RF_1RE0RB_1LA0LC_0RD1RZ}}
 
|10 ↑↑ 5.12468
 
|-
* [[Repeated Word List]] (RWL_mod; more detailed description for RWLAcc)
|{{TM|1RB0RF_1LC1LB_0RE0LD_0LC0LB_0RA1RE_0RD1RZ}}
 
|10 ↑↑ 5.03230
== 1RB2LA1RC3RA_1LA2RA2RB0RC_1RZ3LC1RA1RB ==
|-
 
|{{TM|1RB1LA_1LC0RF_1LD1LC_1LE0RE_0RB0LC_1RZ1RA}}
{{machine|1RB2LA1RC3RA_1LA2RA2RB0RC_1RZ3LC1RA1RB}
|10 ↑↑ 4.91072
{{TM|1RB2LA1RC3RA_1LA2RA2RB0RC_1RZ3LC1RA1RB} is a non-halting [[BB(4,3)]] TM discovered by Pavel Kropitz in May 2023.<ref>https://discord.com/channels/960643023006490684/1095740122139480195/1113545691994783804</ref In April 2024, Shawn Ligocki showed the TM to follow an infinite pentational rule, proving it non-halting.<ref>https://discord.com/channels/960643023006490684/1095740122139480195/1230591736829575282</ref
|-
 
|{{TM|1RB0LE_1LC1RA_1RE0LD_1LC1LF_1LA0RC_1RZ1LC}}
=== Analysis by Shawn Ligocki ===
|10 ↑↑ 3.33186
https://discord.com/channels/960643023006490684/1095740122139480195/1230591736829575282
|-
 
|{{TM|1RB1RF_1LC1RE_0LD1LB_1LA0RA_0RA0RB_1RZ0RD}}
<pre>
|10 ↑↑ 3.31128
Let D(a, b, c, d, e) = 0^inf 1 2^a 1 3^b 1 01^c 1 2^d <A 2^2e+1 0^inf
|-
 
|{{TM|1RB0LF_1LC0RA_1RD0LB_1LE1RC_1RZ1LA_1LA1LE}}
Level 1: D(a, b, c, 2k+r, e)  ->  D(a, b, c, r, e+2k)
|10 ↑↑ 3.18855
Level 2: D(a, b, c, 1, e)  ->  D(a, b, 0, 1, f2(c, e))
|}
  where f2(c, e) = rep(λx -> 2x+5, c)(e)  ~= 2^c
Level 3: D(a, b, 0, 1, e)  ->  D(a, 0, 0, 1, f3(b, e))
  where f3(b, e) = rep(λx -> f2(x+2, 1), b)(e)  ~= 2^^b
Level 4: D(2a+r, 0, 0, 1, e)  ->  D(r, 0, 0, 1, f4(a, e))
  where f4(a, e) = rep(λx -> f3(2x+7), a)(e)  ~= 2^^^a
Level 5: D(0, 0, 0, 1, e)  ->  D(0, 0, 0, 1, f4(4e+19, f3(1, 1)))
 
 
where the last rule repeats forever.
</pre>
 
=== References

Latest revision as of 10:46, 3 April 2026

List of incomplete pages:


1RB2LA1RC3RA_1LA2RA2RB0RC_1RZ3LC1RA1RB

{{machine|1RB2LA1RC3RA_1LA2RA2RB0RC_1RZ3LC1RA1RB} {{TM|1RB2LA1RC3RA_1LA2RA2RB0RC_1RZ3LC1RA1RB} is a non-halting BB(4,3) TM discovered by Pavel Kropitz in May 2023.<ref>https://discord.com/channels/960643023006490684/1095740122139480195/1113545691994783804</ref In April 2024, Shawn Ligocki showed the TM to follow an infinite pentational rule, proving it non-halting.<ref>https://discord.com/channels/960643023006490684/1095740122139480195/1230591736829575282</ref

Analysis by Shawn Ligocki

https://discord.com/channels/960643023006490684/1095740122139480195/1230591736829575282 

Let D(a, b, c, d, e) = 0^inf 1 2^a 1 3^b 1 01^c 1 2^d <A 2^2e+1 0^inf

Level 1: D(a, b, c, 2k+r, e)  ->  D(a, b, c, r, e+2k)
Level 2: D(a, b, c, 1, e)  ->  D(a, b, 0, 1, f2(c, e))
  where f2(c, e) = rep(λx -> 2x+5, c)(e)  ~= 2^c
Level 3: D(a, b, 0, 1, e)  ->  D(a, 0, 0, 1, f3(b, e))
  where f3(b, e) = rep(λx -> f2(x+2, 1), b)(e)  ~= 2^^b
Level 4: D(2a+r, 0, 0, 1, e)  ->  D(r, 0, 0, 1, f4(a, e))
  where f4(a, e) = rep(λx -> f3(2x+7), a)(e)  ~= 2^^^a
Level 5: D(0, 0, 0, 1, e)  ->  D(0, 0, 0, 1, f4(4e+19, f3(1, 1)))


where the last rule repeats forever.

=== References

Retrieved from "https://wiki.bbchallenge.org/w/index.php?title=User:Polygon/Page_for_testing&oldid=7008"