New pages

24 August 2025

• 21:1321:13, 24 August 2025 Translated Cyclers (hist | edit) [31 bytes] Sligocki (talk | contribs) (Redirected page to Translated Cycler) Tags: New redirect Visual edit
• 18:0918:09, 24 August 2025 Surprise in a Box (hist | edit) [332 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB2LB1LC_1LA2RB1RB_1RZ2LA0LC}} {{TM|1RB2LB1LC_1LA2RB1RB_1RZ2LA0LC}}, named '''Surprise in a Box''' by Allen Brady, is a halting BB(3,3) TM which runs surprisingly long on a surprisingly small segment of the tape. It halts after 2,315,619 steps, but only touches 51 cells on the tape. Category:Stub") Tag: Visual edit: Switched

23 August 2025

• 18:2118:21, 23 August 2025 BB(1,m) (hist | edit) [694 bytes] Buffalo Buffalo 1 (talk | contribs) (Created page with "{| class="wikitable" |+ Small busy beaver values<ref>P. Michel, "[https://bbchallenge.org/~pascal.michel/ha.html Historical survey of Busy Beavers]".</ref> ! !!1-state |- ! 2-symbol | BB(1) = 1 (Halt) |}") originally created as "BB(1)"

19 August 2025

• 20:3520:35, 19 August 2025 Universal Turing Machine (hist | edit) [1,684 bytes] Sligocki (talk | contribs) (Created page with "A '''Universal Turing Machine''' (UTM) is a Turing Machine which can simulate any other TM (encoded onto input tape). The precise definition requires defining the encoding function to map simulated TMs and TM inputs into UTM initial tapes. Since a UTM can simulate any TM, the halting problem for any UTM is not computable. There is a common misconception that the Busy Beaver Functions will become uncomputable once we reach a domain with a UTM (since the general h...") Tag: Visual edit

13 August 2025

• 17:0317:03, 13 August 2025 1RB1LE 1LC0RA 1RB1LD 1LC0LC 1RF0LB ---1RE (hist | edit) [55 bytes] Qwerpiw (talk | contribs) (Redirected page to 1RB1LC 1LA1RE 0RD0LA 1RZ1LB 1LD0RF 0RD1RB) Tag: New redirect
• 17:0217:02, 13 August 2025 1RB1LC 1LA1RD 1LA0LA 1LF0RE 0RF1RB ---1LB (hist | edit) [55 bytes] Qwerpiw (talk | contribs) (Redirected page to 1RB1LC 1LA1RE 0RD0LA 1RZ1LB 1LD0RF 0RD1RB) Tag: New redirect
• 17:0117:01, 13 August 2025 1RB1LC 1LA1RD 1LA0LA 1LD0RE 0RF1RB ---1LC (hist | edit) [55 bytes] Qwerpiw (talk | contribs) (Redirected page to 1RB1LC 1LA1RE 0RD0LA 1RZ1LB 1LD0RF 0RD1RB) Tag: New redirect
• 17:0117:01, 13 August 2025 1RB1LC 1LA1RD 1LA0LA 1LD0RE 0RF1RB ---1LB (hist | edit) [55 bytes] Qwerpiw (talk | contribs) (Redirected page to 1RB1LC 1LA1RE 0RD0LA 1RZ1LB 1LD0RF 0RD1RB) Tag: New redirect
• 17:0017:00, 13 August 2025 1RB1LC 1LA1RE 0RD0LA ---1LB 1LE0RF 0RD1RB (hist | edit) [55 bytes] Qwerpiw (talk | contribs) (Redirected page to 1RB1LC 1LA1RE 0RD0LA 1RZ1LB 1LD0RF 0RD1RB) Tag: New redirect
• 16:5916:59, 13 August 2025 1RB0RF 1RC1RB 1RD--- 1LE0RA 1RB0LF 0LE1RD (hist | edit) [55 bytes] Qwerpiw (talk | contribs) (Redirected page to 1RB1RA 1RC1RZ 1LD0RF 1RA0LE 0LD1RC 1RA0RE) Tag: New redirect
• 16:5816:58, 13 August 2025 1RB0LE 1RC1RB 1RD--- 1LA0RF 0LA1RD 1RB0RE (hist | edit) [55 bytes] Qwerpiw (talk | contribs) (Redirected page to 1RB1RA 1RC1RZ 1LD0RF 1RA0LE 0LD1RC 1RA0RE) Tag: New redirect
• 16:5716:57, 13 August 2025 1RB--- 1LC0RF 1RE0LD 0LC1RB 1RA1RE 1RE0RD (hist | edit) [55 bytes] Qwerpiw (talk | contribs) (Redirected page to 1RB1RA 1RC1RZ 1LD0RF 1RA0LE 0LD1RC 1RA0RE) Tag: New redirect

11 August 2025

• 10:3010:30, 11 August 2025 Champion (hist | edit) [23 bytes] Polygon (talk | contribs) (Created a redirect to "Champions") Tag: New redirect
• 05:2405:24, 11 August 2025 Σ(6,2) (hist | edit) [19 bytes] Xl643 (talk | contribs) (Redirected page to BB(6)) Tag: New redirect
• 05:2105:21, 11 August 2025 S(6,2) (hist | edit) [19 bytes] Xl643 (talk | contribs) (Redirected page to BB(6)) Tag: New redirect
• 05:2005:20, 11 August 2025 Σ(6) (hist | edit) [19 bytes] Xl643 (talk | contribs) (Redirected page to BB(6)) Tags: New redirect Visual edit: Switched
• 05:1905:19, 11 August 2025 S(6) (hist | edit) [19 bytes] Xl643 (talk | contribs) (Redirected page to BB(6)) Tag: New redirect
• 03:5803:58, 11 August 2025 Bonus cryptid (hist | edit) [27 bytes] Int-y1 (talk | contribs) (Redirected page to 1RB3RB---3LA1RA 2LA3RA4LB0LB1LB) Tag: New redirect

10 August 2025

• 19:5619:56, 10 August 2025 0RB1RB 1LC0RA 1RE1LF 1LF1RE 0RD1RD 1LG0LG ---1LB (hist | edit) [21 bytes] ADucharme (talk | contribs) (make BB(7)-compiled Bigfoot redirect to Bigfoot page) Tag: New redirect

9 August 2025

• 03:2403:24, 9 August 2025 FAR (hist | edit) [39 bytes] Sligocki (talk | contribs) (Redirected page to Finite Automata Reduction (FAR)) Tags: New redirect Visual edit
• 03:2403:24, 9 August 2025 CTL (hist | edit) [34 bytes] Sligocki (talk | contribs) (Redirected page to Closed Tape Language (CTL)) Tags: New redirect Visual edit
• 03:2403:24, 9 August 2025 CPS (hist | edit) [33 bytes] Sligocki (talk | contribs) (Redirected page to Closed Position Set (CPS)) Tags: New redirect Visual edit

8 August 2025

• 18:0818:08, 8 August 2025 1RB0RD 0LC1RA 0RA1LB 1RE1LB 1LF1LB ---1LE (hist | edit) [1,365 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB0RD_0LC1RA_0RA1LB_1RE1LB_1LF1LB_---1LE}} {{TM|1RB0RD_0LC1RA_0RA1LB_1RE1LB_1LF1LB_---1LE}} is a non-halting BB(6) TM discovered by mxdys on 14 Sep 2024 ([https://discord.com/channels/960643023006490684/1239205785913790465/1284419946759323700 Discord]) and proven non-halting the next day ([https://discord.com/channels/960643023006490684/1239205785913790465/1284838151348551795 Discord]). It follows rules similar to {{TM|1RB1RE_1LC0RA_0RD1LB_---1RC_1LF1RE_0...")

6 August 2025

• 18:4318:43, 6 August 2025 Tₘ function (hist | edit) [991 bytes] Qwerpiw (talk | contribs) (Created page with "Let M be a non-deterministic Turing machine which recognizes a language L, that is, for every input word u there is an accepting computation with input u if and only if u ∈ L. Let us assume that M terminates on every input. The simplest thing to assume is that if u ∈ L, the TM eventually gives "yes" and if u ∉ L, it gives "no". The smallest time (number of steps) of such a computation is denoted by T_M(u) . For every n >= 1 we define T_M(...") Tag: Visual edit: Switched originally created as "T M function"

5 August 2025

• 14:3314:33, 5 August 2025 1RB--- 0RC1RD 1LA0LA 1LE0RB 1LF1LE 1LC0LD (hist | edit) [947 bytes] N1vi (talk | contribs) (Created page with "{{machine|1RB---_0RC1RD_1LA0LA_1LE0RB_1LF1LE_1LC0LD}} 1D — CA, rule 30 or rule 110")
• 14:0614:06, 5 August 2025 1RB1LE 1LC0RA 0RF0LD 1LE1LA 1RC0LB ---1RC (hist | edit) [2,313 bytes] N1vi (talk | contribs) (Created page with "thumb It is really interesting. I high likely doubt it halts, but it creates pseudo random spaces at the right. I ran it for ~860 million steps and the result is shown at the image. Though it might be a fractal.") Tag: Visual edit

2 August 2025

• 16:0116:01, 2 August 2025 TMBR: August 2025 (hist | edit) [9,138 bytes] Qwerpiw (talk | contribs) (Created page with "{{Stub}} this month in busy beaver for 2025 August") Tag: Visual edit
• 10:2310:23, 2 August 2025 TT (hist | edit) [33 bytes] Int-y1 (talk | contribs) (Redirected page to Terminating Turmite) Tag: New redirect

31 July 2025

• 21:4321:43, 31 July 2025 Doodle function (hist | edit) [1,226 bytes] Qwerpiw (talk | contribs) (Created page with "The '''doodle function''' is a function made by Lawrence Hollom. It is a two-argument function.<ref>https://web.archive.org/web/20230901195926/https://sites.google.com/a/hollom.com/extremely-big-numbers/home/doodle-function</ref> == Definition == The function revolves around a specific type of one-dimensional cellular automaton, in which state of a cell is determined by its own state and state of the cell to its right at previous generation (Hollom's original explanatio...") Tag: Visual edit: Switched

30 July 2025

• 15:5915:59, 30 July 2025 1RB0LD 1RC1RA 1LD0RB 1LE1LA 1RF0RC ---1RE (hist | edit) [1,807 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB0LD_1RC1RA_1LD0RB_1LE1LA_1RF0RC_---1RE}} {{TM|1RB0LD_1RC1RA_1LD0RB_1LE1LA_1RF0RC_---1RE}} is a probviously halting BB(6) Cryptid analzyed by mxdys on 30 July 2025. == Analysis by mxdys == [https://discord.com/channels/960643023006490684/1239205785913790465/1400141896944320602] <pre> 1RB0LD_1RC1RA_1LD0RB_1LE1LA_1RF0RC_---1RE (a,b,c) := 0^inf 1^a 0 01^b 0 11^c+1 B> 0^inf (a,2+b,c) --> (a,b,3+c) (a+1,0,c) --> (a,c,2) (a+1,1,c) --> (a,c,6) (0,0,c...")
• 01:3701:37, 30 July 2025 BBS (hist | edit) [68 bytes] Sligocki (talk | contribs) (Redirected page to Non-halting Turing machine#Translated cycler preperiod) Tags: New redirect Visual edit
• 01:3401:34, 30 July 2025 BBP (hist | edit) [65 bytes] Sligocki (talk | contribs) (Redirected page to Non-halting Turing machine#Translated cycler period) Tags: New redirect Visual edit

28 July 2025

• 02:0502:05, 28 July 2025 BBB (hist | edit) [33 bytes] Int-y1 (talk | contribs) (Redirected page to Beeping Busy Beaver) Tag: New redirect

27 July 2025

• 03:2703:27, 27 July 2025 1RB2LA1RA1RA 1LB1LA3RB--- (hist | edit) [39 bytes] Sligocki (talk | contribs) (Redirected page to 1RB2LA1RA1RA 1LB1LA3RB1RZ) Tags: New redirect Visual edit
• 03:1703:17, 27 July 2025 1RB1LA------ 1RC3LB1RB--- 2LA2LC---0LC (hist | edit) [1,090 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB1LA------_1RC3LB1RB---_2LA2LC---0LC}} {{TM|1RB1LA------_1RC3LB1RB---_2LA2LC---0LC}} is the current BBi(8) champion. It runs for over <math>10^{1565}</math> steps and has a sigma score of exactly <math>\frac{3^{1642} - 11}{2}</math>. It was discovered by Nick Drozd on 26 July 2025 ([https://discord.com/channels/960643023006490684/1084047886494470185/1398753236835635252 Discord link]). == Analysis by Shawn Ligocki == <pre> A(a, b, c) = <A 2^a 0 3^b 1^...")

26 July 2025

• 19:3119:31, 26 July 2025 Initial Busy Beaver (hist | edit) [31 bytes] Qwerpiw (talk | contribs) (Referring to <math>BB_{init}(n, m, T)</math>) Tag: New redirect
• 19:2019:20, 26 July 2025 Σi (hist | edit) [45 bytes] Qwerpiw (talk | contribs) (Redirected page to Instruction-limited busy beaver) Tag: New redirect

25 July 2025

• 10:1710:17, 25 July 2025 BBi (hist | edit) [45 bytes] Int-y1 (talk | contribs) (Redirected page to Instruction-Limited Busy Beaver) Tag: New redirect

22 July 2025

• 18:3618:36, 22 July 2025 Bouncers (hist | edit) [21 bytes] Sligocki (talk | contribs) (Redirected page to Bouncer) Tags: New redirect Visual edit
• 18:3418:34, 22 July 2025 MITMWFAR (hist | edit) [78 bytes] Sligocki (talk | contribs) (Redirected page to Meet-in-the-Middle Weighted Finite Automata Reduction (MITMWFAR)) Tags: New redirect Visual edit: Switched
• 18:3418:34, 22 July 2025 Meet-in-the-Middle Weighted Finite Automata Reduction (MITMWFAR) (hist | edit) [408 bytes] Sligocki (talk | contribs) (Created page with "'''Meet-in-the-Middle Weighted Finite Automata Reduction''' ('''MITMWFAR''') is a Turing machine decider. It is a variation of Finite Automata Reduction (FAR) based upon Weighted Finite Automata. This allows it to decide irregular TMs which cannot be decided by FAR or any other regular decider. See: https://github.com/Iijil1/MITMWFAR/tree/main Category:Deciders Category:Stub") Tag: Visual edit