User contributions for Sligocki
Jump to navigation
Jump to search
17 July 2025
- 17:3517:35, 17 July 2025 diff hist +114 m Reversible Turing Machine →Busy Beaver Champions: Add discord link Tag: Visual edit
- 06:0006:00, 17 July 2025 diff hist +1 m Instruction-Limited Busy Beaver →Champions
- 05:5905:59, 17 July 2025 diff hist +171 Instruction-Limited Busy Beaver →Champions: Add BBi(7) co-champion Tag: Visual edit
- 02:1502:15, 17 July 2025 diff hist +100 m Instruction-Limited Busy Beaver →Champions Tag: Visual edit
16 July 2025
- 23:3723:37, 16 July 2025 diff hist +1,378 Instruction-Limited Busy Beaver Add table of champions Tag: Visual edit
- 21:4821:48, 16 July 2025 diff hist −118 m TMBR: July 2025 →BB Adjacent Tag: Visual edit
- 21:4721:47, 16 July 2025 diff hist +873 N Instruction-Limited 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:3321:33, 16 July 2025 diff hist +292 Terminating Turmite Add some History. Tag: Visual edit
- 21:0121:01, 16 July 2025 diff hist +24 m TMBR: July 2025 No edit summary Tag: Visual edit
- 21:0021:00, 16 July 2025 diff hist −2 m Terminating Turmite No edit summary
- 21:0021:00, 16 July 2025 diff hist +660 N 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:5120:51, 16 July 2025 diff hist +84 m TMBR: July 2025 →Interesting TMs Tag: Visual edit
- 20:4120:41, 16 July 2025 diff hist +842 N 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) @..."
- 16:1716:17, 16 July 2025 diff hist +210 TMBR: July 2025 →Interesting TMs: Add the two bouncer <-> counter TMs
- 06:1706:17, 16 July 2025 diff hist +91 Reversible Turing Machine →Busy Beaver Champions: Partial BB(6) results Tag: Visual edit
- 04:2404:24, 16 July 2025 diff hist +35 Reversible Turing Machine →Busy Beaver Champions: Add TNF sizes computed from my new enumeration code. Tag: Visual edit
- 03:2903:29, 16 July 2025 diff hist +477 Turing machine Note quadruple vs. quintuple naming. Tag: Visual edit
- 03:2603:26, 16 July 2025 diff hist +154 Reversible Turing Machine Clarify what we know about 1-tape RTMs. Technically, Bennett only talks about quadruple TMs. I suspect it applies to quintuple TMs as well, but remains to be proven. Tag: Visual edit
15 July 2025
- 21:4021:40, 15 July 2025 diff hist +26 m TMBR: July 2025 No edit summary Tag: Visual edit
- 21:3321:33, 15 July 2025 diff hist −2 m TMBR: July 2025 No edit summary Tag: Visual edit: Switched
- 21:3221:32, 15 July 2025 diff hist +2,623 N TMBR: 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:5620:56, 15 July 2025 diff hist +730 N Category:This Month in Beaver Research 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..."
- 19:1819:18, 15 July 2025 diff hist 0 BB(6) →Holdouts: Update holdout count Tag: Visual edit
- 19:1719:17, 15 July 2025 diff hist +1 Holdouts lists BB(6) holdout count update Tag: Visual edit
14 July 2025
- 04:0404:04, 14 July 2025 diff hist +342 Reversible Turing Machine Note Bennett. Briefly for now until I read his paper in more depth. Tag: Visual edit
13 July 2025
- 06:5806:58, 13 July 2025 diff hist +7 m Lazy Beaver →Computed Values: Add missing value Tag: Visual edit
- 06:5306:53, 13 July 2025 diff hist +35 N Bbchallenge Redirected page to Busy Beaver Challenge current Tags: New redirect Visual edit
- 06:5306:53, 13 July 2025 diff hist +492 Busy Beaver Challenge Fill in a few details Tag: Visual edit
- 06:4506:45, 13 July 2025 diff hist +35 N Bbchallenge.org Sligocki moved page Bbchallenge.org to Busy Beaver Challenge current Tag: New redirect
- 06:4506:45, 13 July 2025 diff hist 0 m Busy Beaver Challenge Sligocki moved page Bbchallenge.org to Busy Beaver Challenge
- 03:3003:30, 13 July 2025 diff hist 0 m Reversible Turing Machine →See Also Tag: Visual edit
- 03:1003:10, 13 July 2025 diff hist +146 Reversible Turing Machine →Definition Tag: Visual edit
- 02:5902:59, 13 July 2025 diff hist +2,107 N 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:4602:46, 13 July 2025 diff hist +28 N Turing Machine Redirected page to Turing machine current Tag: New redirect
9 July 2025
- 16:5416:54, 9 July 2025 diff hist +12 m 0RB1LD 1LC1RB 1LD1RE 1LA1LE 1LZ0RC No edit summary
- 16:5216:52, 9 July 2025 diff hist +303 Maximum Consecutive Ones Function Add source Tag: Visual edit
- 16:4816:48, 9 July 2025 diff hist +250 Maximum Consecutive Ones Function Add reference
- 16:4416:44, 9 July 2025 diff hist +38 m Busy Beaver Functions →Other Busy Beaver functions: link to num function page Tag: Visual edit
- 16:4316:43, 9 July 2025 diff hist +47 N Num Redirect current Tags: New redirect Visual edit
- 16:4316:43, 9 July 2025 diff hist +2,102 N 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
30 June 2025
- 21:2721:27, 30 June 2025 diff hist +1,091 Busy Beaver Frontier Add conjectures current Tag: Visual edit
- 21:0821:08, 30 June 2025 diff hist +32 m BB(5) link Frontier Tag: Visual edit
- 21:0821:08, 30 June 2025 diff hist +25 m Busy Beaver Functions link Frontier Tag: Visual edit
- 21:0721:07, 30 June 2025 diff hist −2 m Beeping Busy Beaver link Frontier Tag: Visual edit
- 21:0621:06, 30 June 2025 diff hist +4 m Independence from ZFC link Frontier Tag: Visual edit
- 21:0521:05, 30 June 2025 diff hist +610 N 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..."
- 20:5820:58, 30 June 2025 diff hist +2,145 Independence from ZFC Create article and add rough history Tag: Visual edit
28 June 2025
- 13:2613:26, 28 June 2025 diff hist −1 1RB1RA 1RC1RZ 1LD0RF 1RA0LE 0LD1RC 1RA0RE Undo revision 2304 by Jacobzheng (talk) What makes you think it's between 10 and 11? Tag: Undo
21 June 2025
- 03:2703:27, 21 June 2025 diff hist −438 Busy Beaver Functions →Other Busy Beaver functions: Remove ones(n) function from other functions, this one is already mentioned as a synonym for Sigma in that section. Tag: Visual edit
18 June 2025
- 16:3816:38, 18 June 2025 diff hist +19 BB(8) Add a few clarifications of how this is unexplored Tag: Visual edit