New pages

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)")

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

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)")

19:3419:34, 27 February 2026 BB(12) (hist | edit) [133 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

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)")

21:2221:22, 20 February 2026 Repeated Word List (hist | edit) [2,456 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) [793 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...")

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)")

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")

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)")

20:0020:00, 11 February 2026 BB(2,8) (hist | edit) [455 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)")

16:3716:37, 1 January 2026 TMBR: January 2026 (hist | edit) [8,441 bytes] RobinCodes (talk | contribs) (Created this month's TMBR page) originally created as "TMBR: January 2025"
13:0413:04, 1 January 2026 1RB0LB2LA 1LA0RC0LB 2RC2RB0LC (hist | edit) [933 bytes] Azerty (talk | contribs) (Created a page so it's easier to find the article (by nickdrozd) about BBB(3,3).) Tag: Visual edit

17:5317:53, 31 December 2025 (Article title) (hist | edit) [196 bytes] BB fan weird (talk | contribs) (Io dico che per calcolare meglio la bb(n) dobbiamo farla diventare bb(n,m) che e piu veloce a crescere, quindi dobbiamo avere computer piu forti in calcolo e altre cose!) Tag: Visual edit
11:1611:16, 31 December 2025 1RB0LE 1LC1LB 0RD0LC 1RA0RE 1RF1RD 0LA--- (hist | edit) [5,923 bytes] Atoms (talk | contribs) (Created page with "SAME CONFIG (#4) State : D Head run : 1 Template : (('0', None), ('0', 'n'), ('1', 1), ('0', None)) FIRST : step 4 params (2) THEN : step 14 params (4) step 86 params (9) NOW : step 2394 params (21) Call f(x) := $ 0^x 1 $ Then f(2) at step 4, f(4) at step 14, f(9) at 86, f(21) at 2394 SAME CONFIG (#64) State : C Head run : 2 Template : (('0', None), ('0', 'n'), ('1', 'n'), ('0', 'n'), ('1', 1), ('0', None)) FIRST : step 80 params (2, 5, 2) TH...")

09:3509:35, 17 December 2025 Turing completeness (hist | edit) [944 bytes] Azerty (talk | contribs) (Created page with "A Turing-complete system is a system that can compute every computable functions. A Turing-complete system can be used to simulate any Turing machine or other Turing-complete systems. The halting problem is uncomputable on any Turing-complete system. To be Turing-complete, a system must be able to store unbounded memory, access it and must contain non-halting programs (like "while" loops or recursion). === List of Turing-complete systems === This list is non-exhaustiv...") Tag: Visual edit

Navigation menu