New pages

Jump to navigation Jump to search
New pages
Hide registered users | Hide bots | Hide redirects
(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)

19 October 2025

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

12 October 2025

9 October 2025

6 October 2025

5 October 2025

30 September 2025

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

29 September 2025

28 September 2025

27 September 2025

24 September 2025

23 September 2025

22 September 2025

21 September 2025

(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)