New pages

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

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

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

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

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

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"

14:1214:12, 19 October 2025 1RB2LB0LB 2LC2LA0LA 2RD1LC1RZ 1RA2LD1RD (hist | edit) [4,159 bytes] Polygon (talk | contribs) (Created page with "{{machine|1RB2LB0LB_2LC2LA0LA_2RD1LC1RZ_1RA2LD1RD}} {{TM|1RB2LB0LB_2LC2LA0LA_2RD1LC1RZ_1RA2LD1RD|halt}} is a pentational halting BB(4,3) TM. It was discovered in May 2024 by Pavel Kropitz as one of seven long running TMs and achieves a score of over <math>3 \uparrow\uparrow\uparrow 88574</math>. Polygon analysed the TM by hand in October 2025, providing its score. Pavel listed the halting tape as: <pre> 1 Z> 1^(162*3^((3*<(243*3^(6) - 5)/2; (<(54*3^((3b + 11)/2) - 2...")

17:5717:57, 12 October 2025 1RB0LC 1RC1RA 1RD0RF 0LE--- 1LA1LE 0RA1RF (hist | edit) [248 bytes] N1vi (talk | contribs) (Created page with "{{machine|1RB0LC_1RC1RA_1RD0RF_0LE---_1LA1LE_0RA1RF}} 1RB0LC_1RC1RA_1RD0RF_0LE---_1LA1LE_0RA1RF is a machine that yet haven't been analysed thumb|The machine after 30,000 steps")

19:0919:09, 9 October 2025 Transition history (hist | edit) [24 bytes] Polygon (talk | contribs) (Redirected page to transcript) Tag: New redirect

16:4916:49, 6 October 2025 1RB1RD1LC 2LB1RB1LC 1RZ1LA1LD 0RB2RA2RD (hist | edit) [6,739 bytes] Polygon (talk | contribs) (Created page for what seems to be the new BB(4,3) champion)

15:5415:54, 5 October 2025 1RB1RD1LC 2LB1RB1LC 1RZ1LA1LD 2RB2RA2RD (hist | edit) [2,886 bytes] Polygon (talk | contribs) (Created page for one of the "potential BB(4,3) champions")

20:3820:38, 30 September 2025 LIATA (hist | edit) [39 bytes] Sligocki (talk | contribs) (Redirected page to Linear-Inequality Affine Transformation Automata) Tags: New redirect Visual edit
20:3720:37, 30 September 2025 Piecewise Affine Function (hist | edit) [6,210 bytes] Sligocki (talk | contribs) (Created page with "'''Linear-Inequality Affine Transformation Automata (LIATA)''' are a model for computation based upon applying affine transformations to vectors based on cases defined by linear inequalities. They are a generalization of the rules for BMO1 and were proven to be Turing complete. == Example == An example of a LIATA are the rules for BMO1:<math display="block">f(a,b) = \begin{cases} (a-b, 4b+2) & \text{if } a > b \\ (2a+1, b-a) & \text{if } a < b \\ \end{cases}</ma...") Tag: Visual edit originally created as "Linear-Inequality Affine Transformation Automata"
17:1117:11, 30 September 2025 Bug Game (hist | edit) [6,416 bytes] Sligocki (talk | contribs) (Created page with "The '''Bug Game''' is an optimization game in which players design a 2d ''maze'' that a ''bug'' will be slowest to solve. The bug follows a relatively simple algorithm which preferentially visits locations less visited which is guaranteed to always eventually find a way to the destination (if such a path exists), but by exploiting the details of the tie-breaking logic, some mazes can trap the bug for a long time. You can play online at https://buglab.ru/ == History == T...")