All public logs

Combined display of all available logs of BusyBeaverWiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 20:21, 25 November 2024 Sligocki talk contribs created page 1RB1RC 1LC1RE 1LD0LB 1RE1LC 1LE0RF 1RZ1RA (Created page with "{{machine|1RB1RC_1LC1RE_1LD0LB_1RE1LC_1LE0RF_1RZ1RA}} {{TM|1RB1RC_1LC1RE_1LD0LB_1RE1LC_1LE0RF_1RZ1RA}} is a long running Halting BB(6) TM analyzed by Racheline on 25 Nov 2024 ([https://discord.com/channels/960643023006490684/1239205785913790465/1310651468881334394 Discord Link]): Analysis by Racheline: <pre> a_1 = (2^179+1)/3+179 a_2 = (2^a_1+1)/3+a_1 a_3 = (2^a_2+1)/3+a_2 a_4 = (2^a_3+1)/3+a_3-1 a_5 = (2^a_4+1)/3+a_4 the counters after overflow: (10)^17 11 (10)^5...")
• 15:34, 15 November 2024 Sligocki talk contribs created page Talk:Brady's algorithm (Created page with "Hey C7X, what do you think about merging this into the main Tree Normal Form article? My thought is that we could migrate any new content over from here and then turn this into a redirect. IIUC, "Brady's algorithm" is just an alternative name coined by Nick Drozd to describe TNF enumeration. Does that sound right? ~~~~")
• 17:31, 13 November 2024 Sligocki talk contribs created page Transcript (Created page with "A Turing machine '''transcript''' or '''transition history''' is the sequence of transitions that the TM executes when started on a blank tape. Halting TMs have finite transcripts, infinite TMs have infinite transcripts. A finite description of an infinite TM transcript is one way to specify the forward behavior of that TM precisely. Shift rules lead to repeated segments of a TM transcript and vice-versa every repeated segment in a transcript corresponds to a sh...")
• 17:01, 25 September 2024 Sligocki talk contribs created page Hydra function (Created page with "The '''Hydra function''' is Collatz-like function whose behavior is connected to the the unsolved halting problems for the Cryptids Hydra and Antihydra: <math display="block">\begin{array}{l} H(2n) & = & 3n \\ H(2n+1) & = & 3n+1 \\ \end{array}</math> which can alternatively be written as<math display="block">H(n) = \begin{cases} \frac{3n}{2} & \text{if } n \text{ even} \\ \frac{3n-1}{2} & \text{if } n \text{ odd} \\ \end{cases}</math>or...") Tag: Visual edit
• 15:19, 25 September 2024 Sligocki talk contribs created page Lazy Beaver (Created page with "The '''Lazy Beaver''' function is a computable variation of the Busy Beaver function defined by Scott Aaronson in his 2020 review. LB(n, m) is the smallest k such that no n-state, m-symbol Turing machine halts in exactly k steps. == Computed Values == Values found by Terry and Shawn Ligocki in 2021: {| class="wikitable" |+ ! ! ! colspan="5" |States |- ! ! !2 !3 !4 !5 !6 |- | rowspan="5" |Symbols |2 |7 |22 |72 |427 |8,407 |- |3 |23 |351 | | | |- |4...") Tag: Visual edit
• 17:21, 4 September 2024 Sligocki talk contribs created page 1RB1LD 1RC1RB 1LC1LA 0RC0RD (Created page with "{{machine|1RB1LD_1RC1RB_1LC1LA_0RC0RD}} {{TM|1RB1LD_1RC1RB_1LC1LA_0RC0RD}} Blanking Beaver BLB(4,2) champion which creates a blank tape after 32,779,477 steps. It was discovered and reported by Nick Drozd in 2021.<ref>Nick Drozd. [https://nickdrozd.github.io/2021/07/11/self-cleaning-turing-machine.html A New Record in Self-Cleaning Turing Machines]. 2021.</ref> == Analysis by Shawn Ligocki == Let <math display="block">D(a, b) = 0^\infty \; 1^a \; 0^...") Tag: Visual edit
• 04:12, 4 September 2024 Sligocki talk contribs created page 1RB1LA 1LC0RC 1LD1RC 1RB1LE 0LF0LA ---0RB (Created page with "{{machine|1RB1LA_1LC0RC_1LD1RC_1RB1LE_0LF0LA_---0RB}} {{TM|1RB1LA_1LC0RC_1LD1RC_1RB1LE_0LF0LA_1RZ0RB|halt}} Halting TM with long-running Collatz-like analysis. Analysis by @dyuan https://discord.com/channels/960643023006490684/1239205785913790465/1280618026844033086: <pre> C(a, b, c) = 1^a 0 1^b C> 0 1^c C(a, b+3, c) -> C(a+1, b, c+2) C(a, 0, c) -> C(a+1, c, 0) C(a+1, 1, c) -> C(0, a, c+3) C(0, 1, c) -> Halt C(a, 2, c) -> C(0, a+c+4, 0) Start: C(0, 2, 0) </pre> Hal...")
• 23:07, 31 August 2024 Sligocki talk contribs created page 1RB0LF 1RC1RA 1LD0RE 1LB1LD ---1RC 1RC1LA (Created page with "{{machine|1RB0LF_1RC1RA_1LD0RE_1LB1LD_---1RC_1RC1LA}} {{TM|1RB0LF_1RC1RA_1LD0RE_1LB1LD_---1RC_1RC1LA}} Analysis by Shawn Ligocki: A(a, b, c) = 0^inf 10^a <A 10^b 11^c 0^inf A(a+1, b, c+1) -> A(a, b+2, c) A(0, b, c+1) -> A(0, b+3, c) A(0, b, 0) -> A(b+1, 1, 1) A(a+2, b, 0) -> A(a, 1, b+2) A(1, b, 0) -> Halt(b+3) Start: A(0, 0, 0) Analysis by @rae: (a,b,0) -> (a-b-4,2b+5,0) if a>b+4 (a,b,0) -> (3b-a+9,3,0) if 2<=a<=b+4 (1,b,0) -> halt * 3 -> 32-2-3...")
• 20:10, 18 August 2024 Sligocki talk contribs created page 1RB0RB 1LC1RE 1LF0LD 1RA1LD 1RC1RB ---1LC (Created page with "{{machine|1RB0RB_1LC1RE_1LF0LD_1RA1LD_1RC1RB_---1LC}} {{TM|1RB0RB_1LC1RE_1LF0LD_1RA1LD_1RC1RB_---1LC}} Potential Cryptid found by @mxdys on 18 Aug 2024: https://discord.com/channels/960643023006490684/1239205785913790465/1274733002454335601 <pre> start: P(2) P(2a) -> P(3a+4) P(2a+1) -> Q(a+2,1) Q(2a+3,b) -> P(b+5a+6) Q(2a+2,b) -> Q(a,b+2a+5) Q(1,2b+1) -> P(3b+8) Q(1,2b) -> Q(b+2,1) Q(0,b) -> halt P(a) := 0^inf 1^a 011 <D 0^inf Q(a,b) := 0^inf 1^(2a+1) <...")
• 06:06, 13 August 2024 Sligocki talk contribs created page 1RB3RB---3LA1RA 2LA3RA4LB0LB1LB (Created page with "{{TM|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}} BB(2,5) Cryptid found by Daniel Yuan. See https://www.sligocki.com/2024/05/10/bb-2-5-is-hard.html#a-bonus-cryptid<nowiki/>{{Machine|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}} Category:Cryptids Category:Stub") Tag: Visual edit
• 05:58, 13 August 2024 Sligocki talk contribs created page Category:Cryptids (Created page with "Turing machines shown to be Cryptids. Category:Individual machines") Tag: Visual edit
• 04:41, 30 July 2024 Sligocki talk contribs created page 1RB1RA 0RC1RC 1LD0LF 0LE1LE 1RA0LB ---0LC (Created page with "{{machine|1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC}} A probviously halting BB(6) Cryptid found by @mxdys on 30 Jun 2024. Analysis by Shawn Ligocki: <pre> 1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC C(a, b, c) = $ 1^2a+1 C> 0^2b 1^c 01 $ Level 1: C(a, b+2, c) -> C(a+3, b, c) C(a, 1, c+2) -> C(1, a+3, c) C(a, 0, c+1) -> C(1, a+1, c) C(a, 0, 0) -> C(1, 2, 2a+3) C(a, 1, 1) -> C(1, 2, 2a+7) C(a, 1, 0) -> Halt(2a+5) Level 2: C(...")
• 01:46, 18 July 2024 Sligocki talk contribs created page Category:Stub (Created page with "Category for articles that are mostly empty and need improvement.") Tag: Visual edit
• 01:44, 18 July 2024 Sligocki talk contribs created page 1RB3RB---3LA1RA 2LA3RA4LB0LB0LA (Redirected page to Hydra) Tags: New redirect Visual edit
• 03:49, 15 July 2024 Sligocki talk contribs created page Holdouts list (Redirected page to Holdouts lists) Tags: New redirect Visual edit
• 03:49, 15 July 2024 Sligocki talk contribs created page BB(3,3) (Created page with "The 3-state, 3-symbol Busy Beaver problem '''BB(3,3)''' is unsolved. With the discovery of Bigfoot in 2023, we now know that we must solve a Collatz-like problem in order to solve BB(3,3) and thus [https://www.sligocki.com/2023/10/16/bb-3-3-is-hard.html BB(3,3) is Hard]. The current BB(3,3) champion {{TM|0RB2LA1RA_1LA2RB1RC_1RZ1LB1LC}} was discovered by Terry and Shawn Ligocki in 2007, proving the lower bounds: <math display="block">\begin{arr...")
• 03:05, 15 July 2024 Sligocki talk contribs created page 1RB2LA0LA 2LC---2RA 0RA2RC1LC (Created page with "{{machine|1RB2LA0LA_2LC---2RA_0RA2RC1LC}} {{TM|1RB2LA0LA_2LC---2RA_0RA2RC1LC}} <code>@-d</code> — 13 Jun 2024 at 1:28 AM ET Proved this TM infinite in Coq: https://discord.com/channels/960643023006490684/1259770474897080380/1261554831055786045")
• 02:58, 13 July 2024 Sligocki talk contribs created page Champions (Created page with "Busy Beaver '''Champions''' are the current record holding Turing machines who maximize a Busy Beaver function. In this article we focus specifically on the longest running TMs. Some have been proven to be the longest running of all (and so are the ultimate champion) while others are only current champions and may be usurped in the future. For smaller domains, Pascal Michel's website is the canonical source for [https://bbchallenge.org/~pascal.mich...") Tag: Visual edit
• 19:16, 12 July 2024 Sligocki talk contribs created page File:BB6 holdouts 7296.txt
• 19:16, 12 July 2024 Sligocki talk contribs uploaded File:BB6 holdouts 7296.txt
• 18:59, 12 July 2024 Sligocki talk contribs created page BB(6) (Created page with "The 6-state, 2-symbol Busy Beaver problem '''BB(6)''' is unsolved. With the discovery of Antihydra in 2024, we now know that we must solve a Collatz-like problem in order to solve BB(6). The current BB(6) champion {{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE}} was discovered by Pavel Kropitz in 2022 proving the lower bound:<ref>Shawn Ligocki. 2022. "BB(6, 2) > 10↑↑15". https://www.sligocki.com/2022/06/21/bb-6-2-t15.html</ref> <math display="block">S(6) >...") Tag: Visual edit
• 03:27, 12 July 2024 Sligocki talk contribs created page BB(3) (Created page with "The 3-state 2-symbol Busy Beaver problem '''BB(3)''' was proven by Shen Lin in his 1963 doctoral dissertation<ref>Shen Lin. 1963. Computer studies of Turing machine problems. PhD dissertation. Ohio State University. https://etd.ohiolink.edu/acprod/odb_etd/etd/r/1501/10?clear=10&p10_accession_num=osu1486554418657614</ref> and republished in 1965.<ref>Lin, Shen; Radó, Tibor (April 1965). "Computer Studies of Turing Machine Problems". ''Journal of the ACM''. '''12''' (2):...") Tag: Visual edit: Switched
• 02:59, 12 July 2024 Sligocki talk contribs created page Template:Documentation (Created page with "{{#invoke:documentation|main|_content={{ {{#invoke:documentation|contentTitle}}}}}}<noinclude> <!-- Add categories to the /doc subpage --> </noinclude>")
• 02:18, 12 July 2024 Sligocki talk contribs created page Green's machines (List of Milton Green's Machines) Tag: Visual edit: Switched
• 01:59, 12 July 2024 Sligocki talk contribs created page Template:TM (Create TM convenience Template that automatically (1) links to bbchallenge URL and (2) puts text in <code> block.)
• 14:22, 11 July 2024 Sligocki talk contribs created page 1RB0RE 0RC--- 1LD1LE 1LE1LD 1RF0LC 1RA1RF (Created page with "{{machine|1RB0RE_0RC---_1LD1LE_1LE1LD_1RF0LC_1RA1RF}} https://bbchallenge.org/1RB0RE_0RC---_1LD1LE_1LE1LD_1RF0LC_1RA1RF mxdys — 11 Jul 2024 at 7:10 AM ET <pre> 1RB0RE_0RC---_1LD1LE_1LE1LD_1RF0LC_1RA1RF (chaotic 1dCA in bell) (...0 a1 a2 ... an > b1 b2 ... bm 0...) := (0^inf 0 1^a1 0 1^a2 ... 0 1^an E> 1^b1 0 1^b2 0 ... 1^bm 0 0^inf) (...0 a1 a2 ... an < b1 b2 ... bm 0...) := (0^inf 0 1^a1 0 1^a2 ... 0 1^an <E 1^b1 0 1^b2 0 ... 1^bm 0 0^inf) start from: ...0 1...")
• 04:36, 11 July 2024 Sligocki talk contribs created page Adjacent (Created page with "Two Turing machines are '''adjacent''' if you can get from one to the other by modifying only one transition and (optionally) applying a permutation. Adjacent TMs are useful to think about at times because they can have similar behavior or follow similar rules. This is definitely not true for all adjacent TMs, but it is in some cases. == Examples == A good example of adjacent TMs are the 5 BB(5) shift overflow counters from Skelet's 43 holdouts:<ref>Shaw...") Tag: Visual edit
• 21:28, 10 July 2024 Sligocki talk contribs created page Permutation (Created page with "Turing machine A is a '''permutation''' of Turing machine B if they are isomorphic up to permuting (renaming) states, symbols (aside from the blank symbol) and directions. If the start state is not affected by the permutation, then the two TMs are functionally identical and are represented by a single TM in TNF. If the start state is changed, then TM A is functionally identical to TM B started in a different start state. Therefore we can say that an n-state TM has ef...") Tag: Visual edit
• 20:10, 10 July 2024 Sligocki talk contribs created page Mother of Giants (Created page with "The '''Mother of Giants''' is a collection of adjacent Turing machines, some of which are Cryptids in the 5-state Beeping Busy Beaver problem that probviously quasihalt. They must all be proven to halt or not if we want to solve BBB(5). The TMs are all the "children" of <code>1RB1LE_0LC0LB_0LD1LC_1RD1RA_---0LA</code> where children means all the TMs created by filling in the undefined <code>E0</code> transition. See https://www.sligocki.co...") Tag: Visual edit
• 19:57, 10 July 2024 Sligocki talk contribs created page Probviously (Redirected page to Probvious) Tags: New redirect Visual edit
• 19:57, 10 July 2024 Sligocki talk contribs created page Probvious (Probvious) Tag: Visual edit: Switched
• 04:59, 10 July 2024 Sligocki talk contribs created page TNF enumeration (Redirected page to Tree Normal Form) Tags: New redirect Visual edit
• 04:52, 10 July 2024 Sligocki talk contribs created page TNF-1RB (Redirected page to Tree Normal Form#TNF-1RB) Tags: New redirect Visual edit
• 04:51, 10 July 2024 Sligocki talk contribs created page TNF (Redirected page to Tree Normal Form) Tags: New redirect Visual edit
• 04:36, 10 July 2024 Sligocki talk contribs created page Tree Normal Form (TNF) Tag: Visual edit
• 03:22, 10 July 2024 Sligocki talk contribs created page BB(2) (BB(2)) Tag: Visual edit: Switched
• 04:21, 8 July 2024 Sligocki talk contribs created page 1RB1RA 1LC0RE 0LF1LD 1LA1LC 1RA1RB ---0LD (unbiased random walk)
• 17:55, 26 June 2024 Sligocki talk contribs created page 1RB1RE 1LC0RA 0RD1LB ---1RC 1LF1RE 0LB0LE (Created page with "{{machine|1RB1RE_1LC0RA_0RD1LB_---1RC_1LF1RE_0LB0LE}} https://bbchallenge.org/1RB1RE_1LC0RA_0RD1LB_---1RC_1LF1RE_0LB0LE A BB(6) TM which is modeled by <pre> (a, c) -> (a-c-1, 4c+5) if a > c (a, c) -> (2a+2, c-a-1) if a < c (a, c) -> Halt if a = c </pre> for <code>(a, c) = 0^inf 10^a 0 1^c E> 0^inf</code>. It has seems like it could be a Cryptid since it seems hard to predict whether we could ever end up in <code>(n, n)</code>, but investigations are ongoing o...")
• 04:35, 24 June 2024 Sligocki talk contribs created page User talk:Sligocki (Created blank page)
• 03:44, 24 June 2024 Sligocki talk contribs created page Cryptid (Redirected page to Cryptids) Tags: New redirect Visual edit
• 03:30, 24 June 2024 Sligocki talk contribs created page 1RB2LC1RC 2LC---2RB 2LA0LB0RA (Start discussion)
• 04:18, 21 June 2024 Sligocki talk contribs created page Closed Set (Create page on general Closed Set methods) Tag: Visual edit: Switched
• 19:25, 20 June 2024 Sligocki talk contribs created page 1RB0LD 1RC0RF 1LC1LA 0LE1RZ 1LF0RB 0RC0RE (Created page with "{{machine|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE}} https://bbchallenge.org/1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE Current BB(6) Champion. Discovered by Pavel Kropitz on 30 May 2022. This TM runs for over 10↑↑15 steps. See analysis: [https://www.sligocki.com/2022/06/21/bb-6-2-t15.html BB(6, 2) > 10↑↑15].")
• 18:05, 20 June 2024 Sligocki talk contribs created page 1RB0RC 1LC1LF 1RD0LB 1RZ0LE ---1RA 1LB0RE (Created page with "{{machine|1RB0RC_1LC1LF_1RD0LB_1RZ0LE_---1RA_1LB0RE}} BB6 (with one unfilled transition) score/sigma champion: https://bbchallenge.org/1RB0RC_1LC1LF_1RD0LB_1RZ0LE_---1RA_1LB0RE does something sort of similar to 1RB1RA_1LC1RF_1RE1LD_0RD1LB_---0RA_1RZ0LE, but with A(a, 3k+r, c) -> A(a+4k, r, c) instead of the C(a, 3k+r, c) -> C(a, r, c+2k) above, so it gets about 2x tape size. <pre> 1RB0RC_1LC1LF_1RD0LB_1RZ0LE_---1RA_1LB0RE Steps: ~10^13.15788 = 14_384_000_997_...") Tag: Visual edit
• 18:00, 20 June 2024 Sligocki talk contribs created page 1RB1RA 1LC1RF 1RE1LD 0RD1LB ---0RA 1RZ0LE (Created page with "{{machine|1RB1RA_1LC1RF_1RE1LD_0RD1LB_---0RA_1RZ0LE}} AFAICT this is the current BB6 (with one unused transition) step champion: https://bbchallenge.org/1RB1RA_1LC1RF_1RE1LD_0RD1LB_---0RA_1RZ0LE <pre> 1RB1RA_1LC1RF_1RE1LD_0RD1LB_---0RA_1RZ0LE Steps: ~10^13.39223 = 24_673_582_891_560 Nonzeros: 2_323_223 = 2_323_223 C(a, b, c) = $ 1^a 0 1^b <C 1^2c+1 $ C(a, b+3, c) -> C(a, b, c+2) C(a, 0, c) -> C(a+1, 2c+1, 0) C(a, 1, c) -> C(0, a, c+1) C(0, 2, c) -> C(1, 2c+...") Tag: Visual edit: Switched
• 03:24, 16 June 2024 Sligocki talk contribs created page Inductive rule (Redirected page to Inductive Proof System) Tags: New redirect Visual edit
• 18:02, 14 June 2024 Sligocki talk contribs created page Inductive Proof (Redirected page to Inductive Proof System) Tags: New redirect Visual edit
• 18:01, 14 June 2024 Sligocki talk contribs created page Inductive Proof System (Stub) Tag: Visual edit
• 17:59, 14 June 2024 Sligocki talk contribs created page Transition rule (Redirected page to Directed head notation#Configuration Transitions) Tags: New redirect Visual edit
• 17:14, 14 June 2024 Sligocki talk contribs created page 1RB2RA1LC 2LC1RB2RB ---2LA1LA (Redirected page to Bigfoot) Tags: New redirect Visual edit: Switched