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

• 03:13, 5 September 2025 Sligocki talk contribs created page Template:TMBRnav (Styled TMBR navigation template)
• 12:58, 2 September 2025 Sligocki talk contribs created page BB Domains (Redirected page to Category:BB Domains) Tags: New redirect Visual edit
• 21:05, 29 August 2025 Sligocki talk contribs created page Talk:Backward Reasoning (Created page with "I'm pretty sure Shen Lin describes backwards reasoning way back in his BB(3) paper! ~~~~")
• 15:22, 28 August 2025 Sligocki talk contribs changed block settings for IsiahHutchings talk contribs with an expiration time of indefinite (account creation disabled, autoblock disabled, cannot edit own talk page) (Spamming links to external sites)
• 15:21, 28 August 2025 Sligocki talk contribs deleted page User:IsiahHutchings (Spam: Spam)
• 15:20, 28 August 2025 Sligocki talk contribs deleted page Типы Цветоносных Видов И Интерьерных Растений По Сниженным Ценам Для Опта — 55Опторг (Spam)
• 15:19, 28 August 2025 Sligocki talk contribs blocked IsiahHutchings talk contribs with an expiration time of indefinite (account creation disabled, autoblock disabled) (Spamming links to external sites)
• 20:33, 25 August 2025 Sligocki talk contribs moved page BB(1) to BB(1,m) (Generalize to 1 state BB)
• 14:52, 25 August 2025 Sligocki talk contribs deleted page User:Non-halting Turing Machines (No need for redirect from User namespace. content was: "#REDIRECT Non-halting Turing machine")
• 21:13, 24 August 2025 Sligocki talk contribs created page Translated Cyclers (Redirected page to Translated Cycler) Tags: New redirect Visual edit
• 21:09, 24 August 2025 Sligocki talk contribs moved page 1RB3RB---3LA1RA 2LA3RA4LB0LB1LB to Bonus Cryptid (Use name)
• 18:11, 24 August 2025 Sligocki talk contribs moved page 1RB2LA1LA 2LA0RA2RC ---0LC2RA to Wily Coyote (Move to common name)
• 18:09, 24 August 2025 Sligocki talk contribs created page Surprise in a Box (Created page with "{{machine|1RB2LB1LC_1LA2RB1RB_1RZ2LA0LC}} {{TM|1RB2LB1LC_1LA2RB1RB_1RZ2LA0LC}}, named '''Surprise in a Box''' by Allen Brady, is a halting BB(3,3) TM which runs surprisingly long on a surprisingly small segment of the tape. It halts after 2,315,619 steps, but only touches 51 cells on the tape. Category:Stub") Tag: Visual edit: Switched
• 02:39, 21 August 2025 Sligocki talk contribs created page File:Antihydra Walk.png (The parity sequence of iterated Hydra function for Antihydra by apgoucher. https://discord.com/channels/960643023006490684/1026577255754903572/1271528180246773883)
• 02:39, 21 August 2025 Sligocki talk contribs uploaded File:Antihydra Walk.png (The parity sequence of iterated Hydra function for Antihydra by apgoucher. https://discord.com/channels/960643023006490684/1026577255754903572/1271528180246773883)
• 20:35, 19 August 2025 Sligocki talk contribs created page Universal Turing Machine (Created page with "A '''Universal Turing Machine''' (UTM) is a Turing Machine which can simulate any other TM (encoded onto input tape). The precise definition requires defining the encoding function to map simulated TMs and TM inputs into UTM initial tapes. Since a UTM can simulate any TM, the halting problem for any UTM is not computable. There is a common misconception that the Busy Beaver Functions will become uncomputable once we reach a domain with a UTM (since the general h...") Tag: Visual edit
• 06:00, 11 August 2025 Sligocki talk contribs created page User talk:Xl643 (Created page with "== Naming TMs == Hi Xl643, please stop adding your own personal names for TMs to their pages. The person who discovers a TM has the right to name it. Or alternatively it might be named if there is a common name used in the community. If you'd like to suggest a name in the talk page or on the Discord you are welcome but don't just add it to the page. ~~~~")
• 03:24, 9 August 2025 Sligocki talk contribs created page FAR (Redirected page to Finite Automata Reduction (FAR)) Tags: New redirect Visual edit
• 03:24, 9 August 2025 Sligocki talk contribs created page CTL (Redirected page to Closed Tape Language (CTL)) Tags: New redirect Visual edit
• 03:24, 9 August 2025 Sligocki talk contribs created page CPS (Redirected page to Closed Position Set (CPS)) Tags: New redirect Visual edit
• 18:08, 8 August 2025 Sligocki talk contribs created page 1RB0RD 0LC1RA 0RA1LB 1RE1LB 1LF1LB ---1LE (Created page with "{{machine|1RB0RD_0LC1RA_0RA1LB_1RE1LB_1LF1LB_---1LE}} {{TM|1RB0RD_0LC1RA_0RA1LB_1RE1LB_1LF1LB_---1LE}} is a non-halting BB(6) TM discovered by mxdys on 14 Sep 2024 ([https://discord.com/channels/960643023006490684/1239205785913790465/1284419946759323700 Discord]) and proven non-halting the next day ([https://discord.com/channels/960643023006490684/1239205785913790465/1284838151348551795 Discord]). It follows rules similar to {{TM|1RB1RE_1LC0RA_0RD1LB_---1RC_1LF1RE_0...")
• 22:54, 30 July 2025 Sligocki talk contribs created page File:BB6 num holdouts over time.png (Number of BB(6) holdouts over time.)
• 22:54, 30 July 2025 Sligocki talk contribs uploaded File:BB6 num holdouts over time.png (Number of BB(6) holdouts over time.)
• 15:59, 30 July 2025 Sligocki talk contribs created page 1RB0LD 1RC1RA 1LD0RB 1LE1LA 1RF0RC ---1RE (Created page with "{{machine|1RB0LD_1RC1RA_1LD0RB_1LE1LA_1RF0RC_---1RE}} {{TM|1RB0LD_1RC1RA_1LD0RB_1LE1LA_1RF0RC_---1RE}} is a probviously halting BB(6) Cryptid analzyed by mxdys on 30 July 2025. == Analysis by mxdys == [https://discord.com/channels/960643023006490684/1239205785913790465/1400141896944320602] <pre> 1RB0LD_1RC1RA_1LD0RB_1LE1LA_1RF0RC_---1RE (a,b,c) := 0^inf 1^a 0 01^b 0 11^c+1 B> 0^inf (a,2+b,c) --> (a,b,3+c) (a+1,0,c) --> (a,c,2) (a+1,1,c) --> (a,c,6) (0,0,c...")
• 01:37, 30 July 2025 Sligocki talk contribs created page BBS (Redirected page to Non-halting Turing machine#Translated cycler preperiod) Tags: New redirect Visual edit
• 01:34, 30 July 2025 Sligocki talk contribs created page BBP (Redirected page to Non-halting Turing machine#Translated cycler period) Tags: New redirect Visual edit
• 15:26, 27 July 2025 Sligocki talk contribs moved page TMiBB: July 2025 to TMBR: July 2025 (Acronym rename)
• 15:25, 27 July 2025 Sligocki talk contribs moved page Category:This Month in Busy Beaver to Category:This Month in Beaver Research (Rename to support the TMBR (Timber) acronym)
• 15:08, 27 July 2025 Sligocki talk contribs created page File:Lovecraft beaver.png (Created by Discord user Fern's friend Lauren in 2025. https://discord.com/channels/960643023006490684/992572017683472514/1398470914990936135)
• 15:08, 27 July 2025 Sligocki talk contribs uploaded File:Lovecraft beaver.png (Created by Discord user Fern's friend Lauren in 2025. https://discord.com/channels/960643023006490684/992572017683472514/1398470914990936135)
• 03:27, 27 July 2025 Sligocki talk contribs created page 1RB2LA1RA1RA 1LB1LA3RB--- (Redirected page to 1RB2LA1RA1RA 1LB1LA3RB1RZ) Tags: New redirect Visual edit
• 03:17, 27 July 2025 Sligocki talk contribs created page 1RB1LA------ 1RC3LB1RB--- 2LA2LC---0LC (Created page with "{{machine|1RB1LA------_1RC3LB1RB---_2LA2LC---0LC}} {{TM|1RB1LA------_1RC3LB1RB---_2LA2LC---0LC}} is the current BBi(8) champion. It runs for over <math>10^{1565}</math> steps and has a sigma score of exactly <math>\frac{3^{1642} - 11}{2}</math>. It was discovered by Nick Drozd on 26 July 2025 ([https://discord.com/channels/960643023006490684/1084047886494470185/1398753236835635252 Discord link]). == Analysis by Shawn Ligocki == <pre> A(a, b, c) = <A 2^a 0 3^b 1^...")
• 15:52, 24 July 2025 Sligocki talk contribs moved page Limited Instruction Busy Beaver to Instruction-Limited Busy Beaver (MrBrain suggested this preference since it puts the key word "Instruction" first)
• 18:36, 22 July 2025 Sligocki talk contribs created page Bouncers (Redirected page to Bouncer) Tags: New redirect Visual edit
• 18:34, 22 July 2025 Sligocki talk contribs created page MITMWFAR (Redirected page to Meet-in-the-Middle Weighted Finite Automata Reduction (MITMWFAR)) Tags: New redirect Visual edit: Switched
• 18:34, 22 July 2025 Sligocki talk contribs created page Meet-in-the-Middle Weighted Finite Automata Reduction (MITMWFAR) (Created page with "'''Meet-in-the-Middle Weighted Finite Automata Reduction''' ('''MITMWFAR''') is a Turing machine decider. It is a variation of Finite Automata Reduction (FAR) based upon Weighted Finite Automata. This allows it to decide irregular TMs which cannot be decided by FAR or any other regular decider. See: https://github.com/Iijil1/MITMWFAR/tree/main Category:Deciders Category:Stub") Tag: Visual edit
• 21:47, 16 July 2025 Sligocki talk contribs created page Limited Instruction Busy Beaver (Created page with "An '''n-instruction Turing machine''' is a Turing machine with an arbitrary number of states and symbols, but limited to only ''n'' defined transitions/instructions in its transition table (all others are undefined). The '''Limited Instruction Busy Beaver''' (BBi(n)) problem is the Busy Beaver problem limited to n-instruction TMs. So BBi(n) is the longest runtime for all halting n-instruction TMs when started on a blank tape. A TM is considered to halt as soon as it...")
• 21:00, 16 July 2025 Sligocki talk contribs created page Terminating Turmite (Created page with "A '''Terminating Turmite''' or '''Relative Movement Turing Machine''' is a Turing machine which uses relative directions instead of absolute ones. So instead of moving (L)eft or (R)ight, it (P)roceeds forward (for one step in the same direction as last move or (T)urns-around (move one direction in the opposite direction). TT(n,k) is the maximum steps of all halting n-state, k-symbol Terminating Turmites when started on a blank tape. It was coined by @creeperman7002 w...")
• 20:41, 16 July 2025 Sligocki talk contribs created page 1RB2LA2LC--- 1LA2RB2RD--- 3RB1LC1RD0LA 3LA1RD1LC0RB (Created page with "{{machine|1RB2LA2LC---_1LA2RB2RD---_3RB1LC1RD0LA_3LA1RD1LC0RB}} {{TM|1RB2LA2LC---_1LA2RB2RD---_3RB1LC1RD0LA_3LA1RD1LC0RB}} is a non-halting TT(2,4) TM that is "pretending to be" a probviously halting Cryptid. Rules by Shawn Ligocki: <pre> C(a, b, c) = 0^inf 3 2^a <C 1^b 2^c 3 0^inf = 0^inf 3 2^c 1^b D> 2^a 3 0^inf C(a+1, b, c) -> C(c, b+1, a) C(0, b, c+3) -> C(c, 0, b+6) C(0, b, 2) -> Halt(b+7) C(0, b, 1) -> C(b+5, 0, 2) C(0, b, 0) -> C(b+2, 0, 5) Start: C(1, 0, 2) @...")
• 21:32, 15 July 2025 Sligocki talk contribs created page TMiBB: July 2025 (Created page with "Category:This Month in Busy Beaver This Month in Busy Beaver for July 2025. == Champions == * (Late June) mxdys found a pair of new BB(6) champions pushing it into the pentational values: {{TM| 1RB1RA_1RC1RZ_1LD0RF_1RA0LE_0LD1RC_1RA0RE}} (scoring over 2↑↑2↑↑2↑↑10) and {{TM|1RB1LC_1LA1RE_0RD0LA_1RZ1LB_1LD0RF_0RD1RB}} (scoring over 10↑↑11010000). * mxdys confirms dyuan's BB(2,5) champion {{TM|1RB3LA4RB0R...")
• 20:56, 15 July 2025 Sligocki talk contribs created page Category:This Month in Busy Beaver (Created page with "'''This Month in Busy Beaver''' ('''TMiBB''') is a monthly series of articles dedicated to covering Busy Beaver research progress, announcements and news from each month. It is crowd-sourced, so please contribute. Shawn Ligocki is the current editor-in-chief. The article is expected to be a collection of small blurbs with links to go into more information. Process: * The articles for each month will be created around the start of the month. * Anyone ca...")
• 06:53, 13 July 2025 Sligocki talk contribs created page Bbchallenge (Redirected page to Busy Beaver Challenge) Tags: New redirect Visual edit
• 06:45, 13 July 2025 Sligocki talk contribs moved page Bbchallenge.org to Busy Beaver Challenge
• 02:59, 13 July 2025 Sligocki talk contribs created page Reversible Turing Machine (Created page with "A '''Reversible Turing Machine''' is a Turing machine for which the computation can always be run backwards from any step back to the original configuration. This property (called logical reversibility) has theoretical implications for the limits of computation. Specifically, non-reversible computation cannot scale beyond some limit due to the inherent entropy cost whereas reversible computations may be able to. == Definition == There does not seem to be a completel...") Tag: Visual edit: Switched
• 02:46, 13 July 2025 Sligocki talk contribs created page Turing Machine (Redirected page to Turing machine) Tag: New redirect
• 16:43, 9 July 2025 Sligocki talk contribs created page Num (Redirect) Tags: New redirect Visual edit
• 16:43, 9 July 2025 Sligocki talk contribs created page Maximum Consecutive Ones Function (Created page with "The '''Maximum Consecutive Ones''' function (named <math>num(n)</math> by Ben-Amram) is a Busy Beaver function which measures the maximum number of consecutive 1s left on the tape at halt across all n-state 2-symbol Turing machines which leave all their 1s consecutively. Unlike <math>\Sigma(n)</math>, this allows some amount of order over the "API" of these TMs, so that their output can be used as inputs to another TM in some deterministic fashion. Note however,...") Tag: Visual edit: Switched
• 21:05, 30 June 2025 Sligocki talk contribs created page Busy Beaver Frontier (Created page with "'''The Busy Beaver Frontier'''<ref>Scott Aaronson. 2020. [https://www.scottaaronson.com/papers/bb.pdf The Busy Beaver Frontier]. SIGACT News 51, 3 (August 2020), 32–54. https://doi.org/10.1145/3427361.3427369</ref> was a Busy Beaver survey article published by Scott Aaronson in 2020. It describes the Busy Beaver problem, introduced a number of variants (such as the Lazy Beaver and Beeping Busy Beaver) and made a number of conjectures. This article introduced ma...")
• 05:23, 7 June 2025 Sligocki talk contribs created page 1RB1RZ 0RC0RE 1LD1LA 1LC0LG 0RF1LF 0RD1LF 1LB0LE (Created page with "{{machine|1RB1RZ_0RC0RE_1LD1LA_1LC0LG_0RF1LF_0RD1LF_1LB0LE}} {{TM|1RB1RZ_0RC0RE_1LD1LA_1LC0LG_0RF1LF_0RD1LF_1LB0LE}} is a tetrational halting BB(7) TM with sigma score over $10 \uparrow\uparrow 519$. It was found by Andrew Ducharme on 6 Jun 2025 ([https://discord.com/channels/960643023006490684/1369339127652159509/1380710649306288180 Discord link]). == Analysis by Shawn Ligocki == This TM goes through 2 phases: Phase A and Phase B. <pre> A(a, b) = 0^inf <F 10 1^a 0...")
• 14:15, 30 May 2025 Sligocki talk contribs created page Talk:Collatz-like (Definition: new section)