Talk:1RB1LA 1RC1RE 1LD0RB 1LA0LC 0RF0RD 0RB---

From BusyBeaverWiki
Revision as of 05:13, 3 October 2026 by C7X (talk | contribs) (Link)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Two questions

  1. Is the machine still a holdout?
  2. Should it be added to this page that there is now a formalization that avoids the Baker–Wüstholz-theorem? (From TMBR: September 2026)

C7X (talk) 05:12, 3 October 2026 (UTC)