New pages

19 December 2025

• 12:5912:59, 19 December 2025 1RB1LE 0LC0LB 0LD1LC 1RD1RA 1RD0LA (hist | edit) [65 bytes] Polygon (talk | contribs) (Redirected page to Mother of Giants#1RB1LE 0LC0LB 0LD1LC 1RD1RA 1RD0LA) Tag: New redirect
• 08:5708:57, 19 December 2025 BB(3,5) (hist | edit) [337 bytes] Azerty (talk | contribs) (Added BB(3,5) page) Tag: Visual edit

17 December 2025

• 17:0017:00, 17 December 2025 Turing-complete (hist | edit) [33 bytes] Sligocki (talk | contribs) (Redirected page to Turing completeness) Tags: New redirect Visual edit
• 16:5816:58, 17 December 2025 Turing complete (hist | edit) [33 bytes] Sligocki (talk | contribs) (Redirected page to Turing completeness) Tags: New redirect Visual edit
• 16:5516:55, 17 December 2025 Minsky machine (hist | edit) [30 bytes] Sligocki (talk | contribs) (Redirected page to Register machine) Tags: New redirect Visual edit
• 16:5416:54, 17 December 2025 Lambda calculus (hist | edit) [45 bytes] Sligocki (talk | contribs) (Redirected page to Register machine) Tags: New redirect Visual edit
• 09:3509:35, 17 December 2025 Turing completeness (hist | edit) [772 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

11 December 2025

• 17:2117:21, 11 December 2025 BMO 1 (hist | edit) [55 bytes] RobinCodes (talk | contribs) (Added BMO 1 redirect page) Tag: New redirect

9 December 2025

• 20:2920:29, 9 December 2025 General Recursive Function (hist | edit) [7,167 bytes] Sligocki (talk | contribs) (Start page) Tag: Visual edit: Switched

8 December 2025

• 18:5218:52, 8 December 2025 Space Needle (hist | edit) [55 bytes] RobinCodes (talk | contribs) (Added "Space Needle" redirect page to the TM) Tag: New redirect
• 16:2016:20, 8 December 2025 Register machine (hist | edit) [1,885 bytes] Azerty (talk | contribs) (Created page with "Register machines, also known as Minsky machines, are a Turing-complete model of computation. Register machines contain a set of instructions and at least 2 registers. Each instruction in a program has a number, starting with 1. There are 2 types of instructions: * inc(c, n) add 1 to the register c then jumps to instruction n. * dec(c, n, m) jumps to instruction m if register c equal 0 else subtract 1 to the register c then jump to instruction n. The program halt if...") Tag: Visual edit

7 December 2025

• 12:0712:07, 7 December 2025 0RB2LA1RA 1LA2RB1RC 1RZ1LB1LC (hist | edit) [43 bytes] Polygon (talk | contribs) (Redirected page to 0RB2LA1RA 1LA2RB1RC ---1LB1LC) Tag: New redirect

6 December 2025

• 21:3221:32, 6 December 2025 1RB2LA1RA1RA 1LB1LA3RB1RZ (hist | edit) [1,227 bytes] Azerty (talk | contribs) (Created page with "{{TM|1RB2LA1RA1RA_1LB1LA3RB---|halt}} is the BB(2,4) champion. It was found in 2005 by Terry and Shawn Ligocki. It runs for 3,932,964 steps and leaves 2,050 ones. == Analysis == To do") Tag: Visual edit
• 21:1021:10, 6 December 2025 0RB2LA1RA 1LA2RB1RC ---1LB1LC (hist | edit) [1,256 bytes] Azerty (talk | contribs) (Created the page) Tag: Visual edit
• 21:0321:03, 6 December 2025 1RB3LB---2RA 2LC3RB1LC2RA 3RB1LB3LC2RC (hist | edit) [52 bytes] Azerty (talk | contribs) (Redirected page to 1RB3LB1RZ2RA 2LC3RB1LC2RA 3RB1LB3LC2RC) Tag: New redirect
• 21:0221:02, 6 December 2025 1RB0RA 1LC1LF 1RD0LB 1RA1LE ---0LC 1RG1LD 0RG0RF (hist | edit) [62 bytes] Azerty (talk | contribs) (Redirected page to 1RB0RA 1LC1LF 1RD0LB 1RA1LE 1RZ0LC 1RG1LD 0RG0RF) Tag: New redirect
• 21:0121:01, 6 December 2025 1RB1RD1LC 2LB1RB1LC ---1LA1LD 0RB2RA2RD (hist | edit) [53 bytes] Azerty (talk | contribs) (Redirected page to 1RB1RD1LC 2LB1RB1LC 1RZ1LA1LD 0RB2RA2RD) Tags: New redirect Visual edit
• 20:5920:59, 6 December 2025 1RB3RB5RA1LB5LA2LB 2LA2RA4RB---3LB2LA (hist | edit) [51 bytes] Azerty (talk | contribs) (Redirected page to 1RB3RB5RA1LB5LA2LB 2LA2RA4RB1RZ3LB2LA) Tag: New redirect

5 December 2025

• 16:0416:04, 5 December 2025 TMBR: December 2025 (hist | edit) [17,572 bytes] Sligocki (talk | contribs) (Created page with "{{TMBRnav|November 2025|January 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).'' ==BB Adjacent== == Holdouts == 2025-12") Tag: Visual edit: Switched

4 December 2025

• 21:3021:30, 4 December 2025 Tibor Radó (hist | edit) [305 bytes] Sligocki (talk | contribs) (Create stub)
• 17:5717:57, 4 December 2025 Tiny Tag (hist | edit) [2,061 bytes] JackM4828 (talk | contribs) (created an article based off of tiny tag which was talked about in the discord forum for bb) Tag: Visual edit
• 17:3817:38, 4 December 2025 Shen Lin (hist | edit) [7,977 bytes] Sligocki (talk | contribs) (Created page with "'''Shen Lin''' was an early Busy Beaver researcher. He was a graduate student of Tibor Radó at Ohio State University and solved BB(3) in his PhD dissertation there.<ref name="phd_thesis">Shen Lin. 1963. Computer studies of Turing machine problems. PhD dissertation. Ohio State University. [http://rave.ohiolink.edu/etdc/view?acc_num=osu1486554418657614]</ref> He was the first to describe Translated Cyclers (which he called "partial recurrence") and to publish...") Tag: Visual edit: Switched

3 December 2025

• 21:1721:17, 3 December 2025 Cyclic Tree Busy Beaver (hist | edit) [24 bytes] Sligocki (talk | contribs) (Redirected page to Cyclic Tag) Tags: New redirect Visual edit

2 December 2025

• 15:4415:44, 2 December 2025 List of Busy Beaver Papers (hist | edit) [1,403 bytes] XnoobSpeakable (talk | contribs) (Starting this page, will attempt to add as many papers as I can find) Tag: Visual edit

29 November 2025

• 05:0305:03, 29 November 2025 1RB1LA 1RC1RE 1LD0RB 1LA0LC 0RF0RD 0RB--- (hist | edit) [980 bytes] Autumn-Pan (talk | contribs) (Added brief summary of work done, will be updated as more work comes out in the near future)

28 November 2025

• 12:4512:45, 28 November 2025 Busy Beaver for SKI calculus (hist | edit) [609 bytes] Azerty (talk | contribs) (Created page with "Busy Beaver for SKI calculus (we will call it BBSKI for now) is a variation of the Busy Beaver problem for lambda calculus. == Champions == {| class="wikitable" ! n !! Value !! Champion !! Discoverered by |- | 1 || = 1 || S || ? |- | 2 || = 2 || SS || ? |- | 3 || = 3 || SSS || ? |- | 4 || = 4 || SSSS || ? |- | 5 || = 6 || SSS(SS) || ? |- | 6 || >= 8 || SSS(SSS) || ? |} == See Also == [https://komiamiko.me/math/ordinals/2020/06/21/ski-numerals.html Lower bounds of this...")

23 November 2025

• 22:0622:06, 23 November 2025 Tree Rewriting System (hist | edit) [3,729 bytes] JackM4828 (talk | contribs) (Created a page that deals with a tree rewriting system) Tag: Visual edit

22 November 2025

• 21:0921:09, 22 November 2025 1RB0LD 0RC0RE 1LC0LA ---1LE 0LF0RE 0RA0LE (hist | edit) [455 bytes] RobinCodes (talk | contribs) (Now all Cryptids and probable cryptids should have a wiki page.)
• 21:0321:03, 22 November 2025 1RB1LD 1RC0LE 1LA1RE 0LF1LA 1RB0RB ---0LB (hist | edit) [408 bytes] RobinCodes (talk | contribs) (Initial commit)

19 November 2025

• 20:3020:30, 19 November 2025 User:JackM4828/Unary Cyclic Tag (hist | edit) [1,900 bytes] JackM4828 (talk | contribs) (Created an article based off of a variant of cyclic tag.) originally created as "Unary Cyclic Tag"

17 November 2025

• 01:2401:24, 17 November 2025 BB(2,7) (hist | edit) [4,770 bytes] Tjligocki (talk | contribs) (Beginning an investigation of BB(2,7))

16 November 2025

• 13:2013:20, 16 November 2025 Holdout lists (hist | edit) [28 bytes] Qwertyasdf (talk | contribs) (Redirected page to Holdouts lists) Tag: New redirect

15 November 2025

• 22:0522:05, 15 November 2025 Cyclic Tag (hist | edit) [9,885 bytes] JackM4828 (talk | contribs) (I have created a page dealing with Cyclic Tag. A very minimally Turing-complete system. Thanks.) Tag: Visual edit

14 November 2025

• 19:5319:53, 14 November 2025 Quick Sim (hist | edit) [45 bytes] Sligocki (talk | contribs) (Redirected page to Accelerated simulator#Quick Sim) Tags: New redirect Visual edit
• 19:5119:51, 14 November 2025 Hashlife (hist | edit) [44 bytes] Sligocki (talk | contribs) (Redirected page to Accelerated Simulator#hashlife) Tags: New redirect Visual edit

10 November 2025

• 20:2520:25, 10 November 2025 Fractran (hist | edit) [27,225 bytes] Sligocki (talk | contribs) (Created page with "'''Fractran''' (originally styled FRACTRAN) is an esoteric model of computation invented by John Conway in 1987.<ref>Conway, John H. (1987). "FRACTRAN: A Simple Universal Programming Language for Arithmetic". ''Open Problems in Communication and Computation''. Springer-Verlag New York, Inc. pp. 4–26. <nowiki>http://doi.org/10.1007/978-1-4612-4808-8_2</nowiki></ref> In this model a program is simply a finite list of fractions, the program state is an integer. For more d...") Tag: Visual edit: Switched
• 19:5819:58, 10 November 2025 1RB2RA3LB---2LB 2LA0LA4RB0RB1LA (hist | edit) [403 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB2RA3LB---2LB_2LA0LA4RB0RB1LA}} {{stub}} {{TM|1RB2RA3LB---2LB_2LA0LA4RB0RB1LA}} appears to be a tetrational BB(2,5) probviously halting Cryptid. Racheline estimates the probability that it surpasses the current champion ({{TM|1RB3LA4RB0RB2LA_1LB2LA3LA1RA1RZ}}) is 1/8. https://discord.com/channels/960643023006490684/1259770421046411285/1329809402378719273")

5 November 2025

• 15:5715:57, 5 November 2025 TMBR: November 2025 (hist | edit) [8,367 bytes] Sligocki (talk | contribs) (Created page with "{{TMBRnav|October 2025|December 2025}} ''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).'' 2025-11") Tag: Visual edit: Switched

2 November 2025

• 18:5118:51, 2 November 2025 Bug (hist | edit) [22 bytes] Sligocki (talk | contribs) (Redirected page to Bug Game) Tag: New redirect

29 October 2025

• 00:4100:41, 29 October 2025 BBl (hist | edit) [45 bytes] Sligocki (talk | contribs) (Redirected page to Busy Beaver for lambda calculus) Tags: New redirect Visual edit

28 October 2025

• 18:1118:11, 28 October 2025 Generalized Collatz Problems (hist | edit) [42 bytes] Sligocki (talk | contribs) (Redirected page to Generalized Collatz Function) Tags: New redirect Visual edit
• 18:1018:10, 28 October 2025 Generalized Collatz Problem (hist | edit) [42 bytes] Sligocki (talk | contribs) (Redirected page to Generalized Collatz Function) Tags: New redirect Visual edit
• 18:0918:09, 28 October 2025 Generalized Collatz Function (hist | edit) [2,629 bytes] Sligocki (talk | contribs) (Created page with "A '''Generalized Collatz Function (GCF)''' is a function which naturally generalizes the classic Collatz function defined by Conway in his 1972 paper "Unpredictable iterations".<ref name=":0">John. H. Conway. 1972. [https://gwern.net/doc/cs/computable/1972-conway.pdf Unpredictable iterations]. In Proc. 1972 Number Theory Conf., Univ. Colorado, Boulder, pages 49–52.</ref> They are functions defined piecewise based upon the remainder of the input (modulo some value) wher...") Tag: Visual edit
• 16:3716:37, 28 October 2025 PAF (hist | edit) [39 bytes] Sligocki (talk | contribs) (Redirected page to Piecewise Affine Function) Tags: New redirect Visual edit
• 15:5615:56, 28 October 2025 1RB1RF 1RC0RA 1LD1RC 1LE0LE 0RA0LD 0RB--- (hist | edit) [50 bytes] RobinCodes (talk | contribs) (Added redirect page for BMO7) Tag: New redirect

26 October 2025

• 10:4210:42, 26 October 2025 1RB1LB2LC 1LA2RB1RB ---0LA2LA (hist | edit) [1,770 bytes] RobinCodes (talk | contribs) (Created page for the last BB(3,3) holdout that does not have one yet) Tag: Visual edit

25 October 2025

• 17:5317:53, 25 October 2025 1RB3RA2LB1LB1RB 2LA2RA4LA1LA--- (hist | edit) [45 bytes] RobinCodes (talk | contribs) (Redirect page. Equivalent.) Tag: New redirect

24 October 2025

• 20:1220:12, 24 October 2025 1RB3LB1RZ2RA 2LC3RB1LC2RA 3RB1LB3LC2RC (hist | edit) [839 bytes] RobinCodes (talk | contribs) (Created page for BB3x4 champion.) Tag: Visual edit
• 11:2711:27, 24 October 2025 1RB1RF 1LC1LF 0RE1LD 0LB1LD ---1RC 1RA0RD (hist | edit) [1,331 bytes] RobinCodes (talk | contribs) (Added page for unverified probvious nonhalter machine found by Racheline) Tag: Visual edit

22 October 2025

• 18:0118:01, 22 October 2025 1RB1RF 0LC1RC 1RD1LC 1RZ0RE 1RA1LF 1RA0LE (hist | edit) [3,560 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB1RF_0LC1RC_1RD1LC_---0RE_1RA1LF_1RA0LE}} {{TM|1RB1RF_0LC1RC_1RD1LC_---0RE_1RA1LF_1RA0LE}} == Analysis by Shawn Ligocki == https://discord.com/channels/960643023006490684/1239205785913790465/1430590536825442384 <pre> 1RB1RF_0LC1RC_1RD1LC_---0RE_1RA1LF_1RA0LE A> 10 -> 11 A> 0 1^n A> 00 -> 11 A> 1^n 0 for n >= 1 0 1^2k+3 A> 11 -> 1^4 0 1^2k+1 A> 0 1 A> 1^2 0 -> 1^5 Z> (Halt) 0 1 A> 1^3 0 -> 1^4 0 1 A> 0 1 A> 1^4 -> 1^5 A> 1 0 1^2k A> 11 -> 1^2k+3 A> A(...") originally created as "1RB1RF 0LC1RC 1RD1LC ---0RE 1RA1LF 1RA0LE"