New pages

Jump to navigation Jump to search
New pages
Hide registered users | Hide bots | Show redirects

5 November 2026

4 November 2026

1 November 2026

31 October 2026

29 October 2026

28 October 2026

  • 20:5820:58, 28 October 2026 Multi-tape Turing Machines (hist | edit) [1,180 bytes] Merieke (talk | contribs) (Created page with " Multi-tape Turing Machines are like normal Turing machines but with more tapes. BB(n,m,o) = the maximum number of steps taken by a n state, m symbol, o tape Turing machine. In addition to going left and right, it can also go up and down. Rules * Going up or down is not required for each step. * The head starts on the lowermost tape. * A step can just be going up or down. * Each tape needs it own instructions The Champion for BB(2,2,2) is this. S(2,2,2) > 16. Sigma(2...") originally created as "2D Tms"

23 October 2026

22 October 2026

21 October 2026

  • 17:2217:22, 21 October 2026 1RB1LA 1LC0RE 1LF1LD 1RE0LC 1LB1RA ---0LA (hist | edit) [985 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB1LA_1LC0RE_1LF1LD_1RE0LC_1LB1RA_---0LA}} {{TM|1RB1LA_1LC0RE_1LF1LD_1RE0LC_1LB1RA_---0LA}} is a BB(6) potential Cryptid found by Marco Dos Santos using Gemini and reported in his paper [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]. The probvious behavior of these TMs has not yet been analyzed. == Analysis by Marco Dos Santos == <pre> Consider: C(a,b,c,d) = 0^in...")
  • 17:2117:21, 21 October 2026 1RB1LE 1RC1RA 0LD1RB 1LE1LD 1RF0LA ---0RE (hist | edit) [1,056 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB1LE_1RC1RA_0LD1RB_1LE1LD_1RF0LA_---0RE}} {{TM|1RB1LE_1RC1RA_0LD1RB_1LE1LD_1RF0LA_---0RE}} is a BB(6) potential Cryptid found by Marco Dos Santos using Gemini and reported in his paper [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]. The probvious behavior of these TMs has not yet been analyzed. == Analysis by Marco Dos Santos == <pre> Consider: E(a, b, c) = 0^in...")
  • 17:2117:21, 21 October 2026 1RB1RC 1LC1LC 1RE0LD 1LB1RF ---1RA 0RD1RD (hist | edit) [823 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB1RC_1LC1LC_1RE0LD_1LB1RF_---1RA_0RD1RD}} {{TM|1RB1RC_1LC1LC_1RE0LD_1LB1RF_---1RA_0RD1RD}} is a BB(6) potential Cryptid found by Marco Dos Santos using Gemini and reported in his paper [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]. The probvious behavior of these TMs has not yet been analyzed. == Analysis by Marco Dos Santos == <pre> Consider: C(a, b, c) = 0^in...")
  • 17:1917:19, 21 October 2026 1RB1LF 0RC1RD 1LA1LD 1LE0RA ---1LC 0LA1LA (hist | edit) [1,561 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB1LF_0RC1RD_1LA1LD_1LE0RA_---1LC_0LA1LA}} {{TM|1RB1LF_0RC1RD_1LA1LD_1LE0RA_---1LC_0LA1LA}} is a BB(6) potential Cryptid found by Marco Dos Santos using Gemini and reported in his paper [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]. The probvious behavior of these TMs has not yet been analyzed. == Analysis by Marco Dos Santos == <pre> Consider: C(a, b) = 0^inf 1...")
  • 17:1817:18, 21 October 2026 1RB0LC 0LC1RF 1LE1RD 0RC1RC 0LA1LA ---1RA (hist | edit) [1,945 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB0LC_0LC1RF_1LE1RD_0RC1RC_0LA1LA_---1RA}} {{TM|1RB0LC_0LC1RF_1LE1RD_0RC1RC_0LA1LA_---1RA}} is a BB(6) potential Cryptid found by Marco Dos Santos using Gemini and reported in his paper [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]. The probvious behavior of these TMs has not yet been analyzed. == Analysis by Marco Dos Santos == <pre> Consider: E(a, k, c) = 0^in...")
  • 17:1717:17, 21 October 2026 1RB0LF 1RC1RA 0RD0RB 1LE--- 0LA1LE 1RD1LA (hist | edit) [4,047 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB0LF_1RC1RA_0RD0RB_1LE---_0LA1LE_1RD1LA}} {{TM|1RB0LF_1RC1RA_0RD0RB_1LE---_0LA1LE_1RD1LA}} is a BB(6) potential Cryptid found by Marco Dos Santos using Gemini and reported in his paper [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]. The probvious behavior of these TMs has not yet been analyzed. == Analysis by Marco Dos Santos == <pre> Consider: J(u, v, w) = 0^in...")
  • 17:1517:15, 21 October 2026 1RB1RD 0LC1RA 1RA1LC 0RB1LE 1RF0LD ---0RE (hist | edit) [1,949 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB1RD_0LC1RA_1RA1LC_0RB1LE_1RF0LD_---0RE}} {{TM|1RB1RD_0LC1RA_1RA1LC_0RB1LE_1RF0LD_---0RE}} is a BB(6) potential Cryptid found by Marco Dos Santos using Gemini and reported in his paper [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]. The probvious behavior of these TMs has not yet been analyzed. == Analysis by Marco Dos Santos == <pre> Consider: P_1(c) = 0^inf C>...")
  • 17:1317:13, 21 October 2026 1RB0LF 1LC1RA 0RE0RD ---1LE 1LF1RC 1LC1LA (hist | edit) [812 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB0LF_1LC1RA_0RE0RD_---1LE_1LF1RC_1LC1LA}} {{TM|1RB0LF_1LC1RA_0RE0RD_---1LE_1LF1RC_1LC1LA}} is a BB(6) potential Cryptid found by Marco Dos Santos using Gemini and reported in his paper [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]. The probvious behavior of these TMs has not yet been analyzed. == Analysis by Marco Dos Santos == <pre> Consider: C(a, b) = 0^inf E...")
  • 17:1217:12, 21 October 2026 1RB1RB 1LC0RE ---1LD 0RA1LB 1RA1LF 0LE1LE (hist | edit) [1,254 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB1RB_1LC0RE_---1LD_0RA1LB_1RA1LF_0LE1LE}} {{TM|1RB1RB_1LC0RE_---1LD_0RA1LB_1RA1LF_0LE1LE}} is a BB(6) potential Cryptid found by Marco Dos Santos using Gemini and reported in his paper [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]. The probvious behavior of these TMs has not yet been analyzed. == Analysis by Marco Dos Santos == <pre> Consider: C(a, c, f) = 0^in...")
  • 17:1017:10, 21 October 2026 1RB1RD 0LC1RA 0RA1LC 1RA1LE 1RF0LD ---0RE (hist | edit) [1,600 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB1RD_0LC1RA_0RA1LC_1RA1LE_1RF0LD_---0RE}} {{TM|1RB1RD_0LC1RA_0RA1LC_1RA1LE_1RF0LD_---0RE}} is a BB(6) potential Cryptid found by Marco Dos Santos using Gemini and reported in his paper [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]. The probvious behavior of these TMs has not yet been analyzed. == Analysis by Marco Dos Santos == <pre> Consider: P_1(c) = 0^inf C>...")
  • 17:0917:09, 21 October 2026 1RB1LD 1RC0RA 1LA1RE 0LA0LB 0RB1RF ---1RD (hist | edit) [1,189 bytes] Sligocki (talk | contribs) (Created page with "{{machine|1RB1LD_1RC0RA_1LA1RE_0LA0LB_0RB1RF_---1RD}} {{TM|1RB1LD_1RC0RA_1LA1RE_0LA0LB_0RB1RF_---1RD}} is a BB(6) potential Cryptid found by Marco Dos Santos using Gemini and reported in his paper [https://arxiv.org/abs/2610.22603 At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier]. The probvious behavior of these TMs has not yet been analyzed. == Analysis by Marco Dos Santos == <pre> Consider: A(a, b, c, d) = 0...")

2 October 2026

1 October 2026

28 September 2026

  • 15:1615:16, 28 September 2026 Placid Platypus (hist | edit) [2,784 bytes] Loader3229 (talk | contribs) (Created page with "The '''Placid Platypus''' function <math>PP(n)</math> <ref>James Harland. [https://dl.acm.org/doi/pdf/10.5555/1151785.1151794 The Busy Beaver, the Placid Platypus and other Crazy Creatures]. 2006.</ref> is the minimal number of states of 2-symbol Turing machines that print exactly n ones when halt. <math> PP(n) \leq n </math>, because you can print each 1 in a state. Also if <math> n > \Sigma(m)</math>, then <math> PP(n) > m </math>. == References == <references /> ...")

13 September 2026

5 September 2026

3 September 2026

  • 17:1017:10, 3 September 2026 1RB0RF 1RC1RF 1LD0LE ---1LC 1RA1LE 1LC1RB (hist | edit) [545 bytes] A6P457 (talk | contribs) (Created page with "{{machine|1RB0RF_1RC1RF_1LD0LE_---1LC_1RA1LE_1LC1RB}} {{TM|1RB0RF_1RC1RF_1LD0LE_---1LC_1RA1LE_1LC1RB}} is a probviously non-halting cryptid similar to Space Needle. == Analysis == <pre>A(x,y) = 0^inf <E 1^x 0 1^y 0^inf A(2x,y) -> A(3x+y+1,2) A(2x+3,y) -> A(x,x+y+4) A(1,y) -> halt A(x) = A(x-3,2) p(x) = The largest n such that 2^n divides x A(x) -> A(x+p(x)+(x/2^p(x)+3)/2) if x/2^p(x)>1 A(2^x) -> halt A(3) -> A(6) -> A(10) -> A(15) -> A(24) -> A(30) -> A(40) -> A(...")

31 August 2026

20 August 2026

18 August 2026

17 August 2026

11 August 2026

Retrieved from "https://wiki.bbchallenge.org/wiki/Special:NewPages"