TMBR: October 2025

From BusyBeaverWiki
Revision as of 18:34, 2 October 2025 by RobinCodes (talk | contribs) (Added error found in BB(4,3))
Jump to navigation Jump to search
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).

Wily Coyote, a BB(3,3) holdout

Blog Posts

Holdouts

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: [1]
  • @star proved that 2 dimension LIATA are Turing complete: [2]
  • BMO1 is a 2d-LIATA so this provides some sense for the difficulty of the problem.