New pages

9 May 2026

• 23:0123:01, 9 May 2026 De Bruijn index (hist | edit) [2,401 bytes] ADucharme (talk | contribs) (creation of page by taking section from lambda calculus page) Tag: Visual edit

2 May 2026

• 10:1810:18, 2 May 2026 TMBR: May 2026 (hist | edit) [3,008 bytes] Polygon (talk | contribs) (Created page with "{{TMBRnav|April 2026|June 2026}} ''This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).'' == Holdouts == *BB(2,7) ** Terry Ligocki enumerated 20K more subtasks, increasing the number of holdouts to '''749,156,843'''. A total of 24K subtasks out of the 1 million subtasks (or '''24%''') have been enumerated.<sup>[https://d...")

23 April 2026

• 22:4122:41, 23 April 2026 1RB--- 0RC0RD 1LD1RB 0LE0LC 1RA0LF 1LD1LE (hist | edit) [4,792 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB---_0RC0RD_1LD1RB_0LE0LC_1RA0LF_1LD1LE}} == Analysis by Shawn Ligocki == https://discord.com/channels/960643023006490684/1239205785913790465/1497001816741646407 <pre> 1RB---_0RC0RD_1LD1RB_0LE0LC_1RA0LF_1LD1LE Let A(a,b,c) = 0^inf 1^a 10^b C> 1^c 0^inf A(a+1,b,c+3) --> A(a,b+2,c) A(a,b,0) --> A(2b+1,1,a+1) A(a,b,1) --> A(2b+3,1,a+1) A(a,b,2) --> A(2b+5,1,a+1) A(0,b,c+5) --> A(2b+4,2,c) A(0,b,4) --> Halt A(0,b,3) --> Halt Start: A(0,1,0) </pre> Simulate...")

17 April 2026

• 11:2411:24, 17 April 2026 1RB---0RB0LA2RA 2LB2LA3RA4LB0LB (hist | edit) [498 bytes] DrDisentangle (talk | contribs) (init)

11 April 2026

• 16:3216:32, 11 April 2026 CounterScript (hist | edit) [2,094 bytes] Azerty (talk | contribs) (Created page) Tag: Visual edit

10 April 2026

• 09:3209:32, 10 April 2026 1RB0LD 0RC1RB 0RD0RA 1LE0RD 1LF--- 0LA1LA (hist | edit) [1,779 bytes] RobinCodes (talk | contribs) (Added page for BMO 8) Tag: Visual edit

7 April 2026

• 09:5009:50, 7 April 2026 1RB1LA 0LC0RC 1LE1RD 1RE1RC 1LF0LA ---1LE (hist | edit) [4,287 bytes] Polygon (talk | contribs) (Created page with "{{machine|1RB1LA_0LC0RC_1LE1RD_1RE1RC_1LF0LA_---1LE}} {{TM|1RB1LA_0LC0RC_1LE1RD_1RE1RC_1LF0LA_---1LE}} is a BB(6) Cryptid similar to Space Needle. It was discovered by Sheep on 7 April 2026.<ref>https://discord.com/channels/960643023006490684/1448375857046360094/1490772706269069313</ref> == Analysis by Daniel Yuan == <pre> So I would say either (0, 0) --> halt (1, n) --> halt (0, n) --> (2, n-1) for n >= 1 (2m, n) --> (3m+n-1, 2) for m >= 1 (2m+1, n) --> (m...")

2 April 2026

• 16:5216:52, 2 April 2026 1RB1LA 1RC0RF 1RD--- 0LE1RB ---0LA 1LD1RF (hist | edit) [18,397 bytes] DrDisentangle (talk | contribs) (initial)

1 April 2026

• 10:4610:46, 1 April 2026 TMBR: April 2026 (hist | edit) [12,598 bytes] Polygon (talk | contribs) (Created page with "{{TMBRnav|March 2026|May 2026}} ''This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).'' This Month in Beaver Research for April 2026. 2026-04")

31 March 2026

• 21:0221:02, 31 March 2026 NGram CPS (hist | edit) [3,233 bytes] Polygon (talk | contribs) (Created page with "'''NGram CPS''' is a decider and a subset of the general CTL method. It generates a set of local configurations in a fixed radius around the TM head, if the set of these local configurations is shown to be closed, the TM is proven non-halting. == Method == It only evaluates the tape in a fixed radius <math>n</math> around the central cell which the TM head is on, called the local configuration. Local configurations contain the state the TM is in, the symbol the...")
• 10:2610:26, 31 March 2026 1RB1LC 1LC1RD 1LA0LB 0RB1RE 1RF0RA ---0RC (hist | edit) [1,010 bytes] Polygon (talk | contribs) (Created page with "{{machine|1RB1LC_1LC1RD_1LA0LB_0RB1RE_1RF0RA_---0RC}} {{TM|1RB1LC_1LC1RD_1LA0LB_0RB1RE_1RF0RA_---0RC}} is a potentially probviously halting BB(6) TM with exponential runtime which was analysed by Racheline on Oct 25, 2025.<ref>https://discord.com/channels/960643023006490684/1239205785913790465/1431570792402915408</ref> == Analysis by Racheline == https://discord.com/channels/960643023006490684/1239205785913790465/1431579799180148738 <pre> 0^inf 1^(2n) C> 1^(2n+5...")

30 March 2026

• 18:2218:22, 30 March 2026 1RB1RA 1LC0RC ---0LD 0LE0RF 1RE0RA 0LF1LB (hist | edit) [1,158 bytes] Polygon (talk | contribs) (Created page with "{{machine|1RB1RA_1LC0RC_---0LD_0LE0LF_1RE0RA_0LF1LB}} {{TM|1RB1RA_1LC0RC_---0LD_0LE0LF_1RE0RA_0LF1LB}} is a BB(6) holdout TM. It was analysed by Racheline on June 29, 2024. == Analysis by Racheline == https://discord.com/channels/960643023006490684/1026577255754903572/1256377562582487140 <pre> encoding: 0^inf 1^a 0 1^b A> 0 1^c 0 1^d ... -> (a,b,c,d,...) rules: (a,4b,0,d,e,f,...) -> (3,a+4b+d,e,f,...) (a,4b+1,0,d,e,f,...) -> (3,a+3b-3,0,0,b+d+1,e,f,...) (a,4b+2,...") originally created as "1RB1RA 1LC0RC ---0LD 0LE0LF 1RE0RA 0LF1LB"

7 March 2026

• 18:0618:06, 7 March 2026 Skelet 26 (hist | edit) [13,816 bytes] Polygon (talk | contribs) (Created page with "{{machine|1RB1LD_1RC0RB_1LA1RC_1LE0LA_1LC---}}{{Stub}} {{TM|1RB1LD_1RC0RB_1LA1RC_1LE0LA_1LC---}}, called '''Skelet #26''', was one of Skelet's 43 holdouts and one of the last holdouts in BB(5). It is a Shift overflow counter and has an individual proof of non-halting in Coq-BB5.<ref>https://github.com/ccz181078/Coq-BB5/blob/main/BusyCoq/Skelet26.v</ref> == References == Category:BB(5)")

3 March 2026

• 10:0710:07, 3 March 2026 TMBR: March 2026 (hist | edit) [9,325 bytes] RobinCodes (talk | contribs) (Created March TMBR, added simulation results) Tag: Visual edit

2 March 2026

• 16:5016:50, 2 March 2026 Skelet 33 (hist | edit) [7,072 bytes] Polygon (talk | contribs) (Created page with "{{machine|1LC1RD_1RE---_0LD0LC_1RB0RA_1RA1LE}}{{Stub}} {{TM|1LC1RD_1RE---_0LD0LC_1RB0RA_1RA1LE}}, called '''Skelet #33''', was one of Skelet's 43 holdouts and one of the last holdouts in BB(5). It is a Shift overflow counter. Category:BB(5)")

27 February 2026

• 19:3419:34, 27 February 2026 BB(12) (hist | edit) [575 bytes] BB fan weird (talk | contribs) (Created page with "il problema a 12 stati e 2 simboli e inesplorato al 100% (per ora), io prevedo che bb(12) sarà praticamente impossibile da enumerare") Tag: Visual edit

21 February 2026

• 12:1612:16, 21 February 2026 Skelet 10 (hist | edit) [3,581 bytes] Polygon (talk | contribs) (Created page with "{{machine|1LC0LA_---0LC_0RD1LA_1LB1RE_1RD0RE}}{{Stub}} {{TM|1LC0LA_---0LC_0RD1LA_1LB1RE_1RD0RE}}, called '''Skelet #10''', was one of Skelet's 43 holdouts and one of the last holdouts in BB(5). It is a double fibonacci counter. Category:BB(5)")

20 February 2026

• 21:2221:22, 20 February 2026 Repeated Word List (hist | edit) [3,233 bytes] Polygon (talk | contribs) (Created page with "'''Repeated Word List''' (short '''RepWL''') is a decider. Category:Deciders {{Stub}}")
• 16:3516:35, 20 February 2026 BB(4,4) (hist | edit) [1,010 bytes] Polygon (talk | contribs) (Created page with "The 4-state 4-symbol Busy Beaver problem, BB(4,4), is unsolved and unexplored. With Cryptids like Bigfoot in the preceding domain BB(3,3), we know that we must solve a Collatz-like problem in order to solve BB(4,4). The current BB(4,4) champion is simply inherited from BB(3,4) as BB(4,4) has not been explored yet. In September 2025, tjligocki ran a test enumeration on one of 1 billion subtasks. The subtask ran for 1.5 hours...")

18 February 2026

• 20:1320:13, 18 February 2026 BB(3,6) (hist | edit) [417 bytes] BB fan weird (talk | contribs) (Created page with "Il problema a 3 stati e 6 simboli e inesplorato, confermo (quasi perche ho meno di 2 cifre di anni e sto ancora imparando a usare le TuringMachine) che bb(3,6)>f omega+100 (3)")

17 February 2026

• 14:5514:55, 17 February 2026 BB(11) (hist | edit) [567 bytes] BB fan weird (talk | contribs) (Created page with "Il problema di bb(11) e inesplorato ed e quasi impossibile per ora, NESSUN LIMITE INFERIORE")

12 February 2026

• 13:3613:36, 12 February 2026 BB(2,9) (hist | edit) [460 bytes] BB fan weird (talk | contribs) (Created page with "Il problema di bb(2,9) (2 stati e 9 simboli) e inesplorato da tutti, cio implica che bb(2,9) e difficilissimo, ho ipotizzato che bb(2,9)≥bb(7)")

11 February 2026

• 20:0020:00, 11 February 2026 BB(2,8) (hist | edit) [669 bytes] BB fan weird (talk | contribs) (Created page with "Il problema di bb(2,8) (macchina di Turing con 2 stati e 8 simboli) e inesplorato, cio significa che bb(2,8) e molto difficile, non ci sono limiti inferiori (lower bound) per bb(2,8)")