TMBR: October 2025: Difference between revisions
Jump to navigation
Jump to search
(Add Wily Coyote for now) |
No edit summary |
||
| Line 5: | Line 5: | ||
* ? Oct 2025. Katelyn Doucette. [https://katelyndoucette.com/articles/building-the-busy-beaver-ladder Building the Busy Beaver Ladder]. | * ? Oct 2025. Katelyn Doucette. [https://katelyndoucette.com/articles/building-the-busy-beaver-ladder Building the Busy Beaver Ladder]. | ||
== Theory == | |||
TODO: Update this section after studying existing literature a bit more. | |||
[[Linear-Inequality Affine Transformation Automata]] (LIATA) were introduced as a generalization of the [[BMO1]] rules: | |||
* @Bard proved that 3 dimension LIATA are Turing complete: [https://discord.com/channels/960643023006490684/1239205785913790465/1420457986564030641] | |||
* @star proved that 2 dimension LIATA are Turing complete: [https://discord.com/channels/960643023006490684/1239205785913790465/1421271424588451915] | |||
* BMO1 is a 2d-LIATA so this provides some sense for the difficulty of the problem. | |||
[[Category:This Month in Beaver Research|2025-10]] | [[Category:This Month in Beaver Research|2025-10]] | ||
Revision as of 18:57, 1 October 2025
| Prev: September 2025 | This Month in Beaver Research | Next: November 2025 |
This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).
Blog Posts
- ? Oct 2025. Katelyn Doucette. Building the Busy Beaver Ladder.
Theory
TODO: Update this section after studying existing literature a bit more.
Linear-Inequality Affine Transformation Automata (LIATA) were introduced as a generalization of the BMO1 rules: