TMBR: October 2025: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
Holdouts: Put holdout details into an expandable box
m Rearrange sections a bit
Line 1: Line 1:
{{TMBRnav|September 2025|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).''
{{TMBRnav|September 2025|November 2025}}[[File:Nico-BB-vs-Antihydra.jpg|thumb|A brave busy beaver confronts the dreaded Antihydra. Copyright [https://www.nicoroper.com/ Nico Roper].]]''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).''


TODO: BB(3x3) month
TODO: BB(3x3) month[[File:Wily Coyote Roadrunner Naming.png|thumb|[[Wily Coyote]], a [[BB(3,3)]] holdout]]


TODO: BB(2x5) month next month (?)
TODO: BB(2x5) month next month (?)
[[File:Nico-BB-vs-Antihydra.jpg|thumb|A brave busy beaver confronts the dreaded Antihydra. Copyright [https://www.nicoroper.com/ Nico Roper].]]
== Misc ==
@Bricks shared a method to measure susceptibility to block-analysis<sup>[https://discord.com/channels/960643023006490684/1239205785913790465/1430227817957953638 1]</sup>, which resulted in the following [https://docs.google.com/spreadsheets/d/1j00LBxxp9W7uz1wZdMIvDCZ56eReuH0IGO9Z8-yybcQ/edit?usp=sharing spreadsheet of machines] which should be easiest to solve using [[Block Analysis|Block-Analysis.]]
@coda shared a mechanical implementation of a Turing Machine<sup>[https://discord.com/channels/960643023006490684/1362008236118511758/1425894649280598066 1]</sup>, [[Antihydra]].[[File:Wily Coyote Roadrunner Naming.png|thumb|[[Wily Coyote]], a [[BB(3,3)]] holdout]]
== Blog Posts ==
== Blog Posts ==


Line 17: Line 10:
== Champions ==
== Champions ==
[[User:Polygon|Polygon]] identified a new [[BB(4,3)]] champion with a score of over <math>10 \uparrow^{4} 4</math> ({{TM|1RB1RD1LC_2LB1RB1LC_1RZ1LA1LD_0RB2RA2RD|halt}}). This TM was first proven to halt by Pavel Kropitz in May 2024, but it's runtime was not known at the time.
[[User:Polygon|Polygon]] identified a new [[BB(4,3)]] champion with a score of over <math>10 \uparrow^{4} 4</math> ({{TM|1RB1RD1LC_2LB1RB1LC_1RZ1LA1LD_0RB2RA2RD|halt}}). This TM was first proven to halt by Pavel Kropitz in May 2024, but it's runtime was not known at the time.
== Theory ==
[[Piecewise Affine Function|Piecewise Affine Functions]] (PAF) were explored as a generalization of the [[BMO1]] rules:
* @Bard proved that 3 dimension PAF are Turing complete: [https://discord.com/channels/960643023006490684/1239205785913790465/1420457986564030641]
* @star proved that 2 dimension PAF are Turing complete: [https://discord.com/channels/960643023006490684/1239205785913790465/1421271424588451915]
* Shawn Ligocki wrote up a proof sketch that 2-region PAF are Turing complete: [https://discord.com/channels/960643023006490684/1239205785913790465/1422772752980639866 <nowiki>[3]</nowiki>]
* It was discovered that Amir Ben-Amram had already proven that 2-dim and 2-region PAF were Turing complete in 2015.
* BMO1 is a 2-dim, 2-region PAF so this provides some sense for the difficulty of the problem.
== Deciders ==
* Inductive deciders
** -d rewrote quick_sim.py in C++, achieving a 6-10x faster runtime<sup>[https://discord.com/channels/960643023006490684/1226543091264126976/1432118726492291173 1][https://discord.com/channels/960643023006490684/1226543091264126976/1433247936942440498 2]</sup>.
** Katelyn Douchette is working on an automated inductive decider<sup>[https://discord.com/channels/960643023006490684/1369339127652159509/1419016459560161280 1][https://discord.com/channels/960643023006490684/1095740122139480195/1427714010697961534 2].</sup> (see [[Inductive Proof System|inductive proofs]])
== Misc ==
* @coda shared a mechanical implementation of a Turing Machine<sup>[https://discord.com/channels/960643023006490684/1362008236118511758/1425894649280598066 1]</sup>, [[Antihydra]].
* @Bricks shared a method to measure susceptibility to block-analysis<sup>[https://discord.com/channels/960643023006490684/1239205785913790465/1430227817957953638 1]</sup>, which resulted in the following [https://docs.google.com/spreadsheets/d/1j00LBxxp9W7uz1wZdMIvDCZ56eReuH0IGO9Z8-yybcQ/edit?usp=sharing spreadsheet of machines] which should be easiest to solve using [[Block Analysis|Block-Analysis.]]


== Holdouts ==
== Holdouts ==
Line 77: Line 89:
**Andrew Ducharme has completed [[BB(2,6)#Stage 3|Stage 3 of Phase 2]], reducing the number of holdouts from 873,469 to 870,085. (0.39% reduction)
**Andrew Ducharme has completed [[BB(2,6)#Stage 3|Stage 3 of Phase 2]], reducing the number of holdouts from 873,469 to 870,085. (0.39% reduction)
</div></div>
</div></div>
== Theory ==
[[Piecewise Affine Function|Piecewise Affine Functions]] (PAF) were explored as a generalization of the [[BMO1]] rules:
* @Bard proved that 3 dimension PAF are Turing complete: [https://discord.com/channels/960643023006490684/1239205785913790465/1420457986564030641]
* @star proved that 2 dimension PAF are Turing complete: [https://discord.com/channels/960643023006490684/1239205785913790465/1421271424588451915]
* Shawn Ligocki wrote up a proof sketch that 2-region PAF are Turing complete: [https://discord.com/channels/960643023006490684/1239205785913790465/1422772752980639866 <nowiki>[3]</nowiki>]
* It was discovered that Amir Ben-Amram had already proven that 2-dim and 2-region PAF were Turing complete in 2015.
* BMO1 is a 2-dim, 2-region PAF so this provides some sense for the difficulty of the problem.
== Deciders ==
* Inductive deciders
** -d rewrote quick_sim.py in C++, achieving a 6-10x faster runtime<sup>[https://discord.com/channels/960643023006490684/1226543091264126976/1432118726492291173 1][https://discord.com/channels/960643023006490684/1226543091264126976/1433247936942440498 2]</sup>.
** Katelyn Douchette is working on an automated inductive decider<sup>[https://discord.com/channels/960643023006490684/1369339127652159509/1419016459560161280 1][https://discord.com/channels/960643023006490684/1095740122139480195/1427714010697961534 2].</sup> (see [[Inductive Proof System|inductive proofs]])


[[Category:This Month in Beaver Research|2025-10]]
[[Category:This Month in Beaver Research|2025-10]]

Revision as of 18:21, 2 November 2025

Prev: September 2025 This Month in Beaver Research Next: November 2025
A brave busy beaver confronts the dreaded Antihydra. Copyright Nico Roper.

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). TODO: BB(3x3) month

Wily Coyote, a BB(3,3) holdout

TODO: BB(2x5) month next month (?)

Blog Posts

Champions

Polygon identified a new BB(4,3) champion with a score of over 1044 (1RB1RD1LC_2LB1RB1LC_1RZ1LA1LD_0RB2RA2RD (bbch)). This TM was first proven to halt by Pavel Kropitz in May 2024, but it's runtime was not known at the time.

Theory

Piecewise Affine Functions (PAF) were explored as a generalization of the BMO1 rules:

  • @Bard proved that 3 dimension PAF are Turing complete: [1]
  • @star proved that 2 dimension PAF are Turing complete: [2]
  • Shawn Ligocki wrote up a proof sketch that 2-region PAF are Turing complete: [3]
  • It was discovered that Amir Ben-Amram had already proven that 2-dim and 2-region PAF were Turing complete in 2015.
  • BMO1 is a 2-dim, 2-region PAF so this provides some sense for the difficulty of the problem.

Deciders

  • Inductive deciders
    • -d rewrote quick_sim.py in C++, achieving a 6-10x faster runtime12.
    • Katelyn Douchette is working on an automated inductive decider12. (see inductive proofs)

Misc

  • @coda shared a mechanical implementation of a Turing Machine1, Antihydra.
  • @Bricks shared a method to measure susceptibility to block-analysis1, which resulted in the following spreadsheet of machines which should be easiest to solve using Block-Analysis.

Holdouts

BB(6) Holdouts count decrease overtime.
BB(6) Holdouts count decrease overtime.
BB Holdout Reduction by Domain
Domain New Holdout Count Previous Holdout Count Holdout Reduction % Reduction
BB(6) 1618 1691 73 4.3%
BB(7) 20,405,295 22,801,601 2,396,306 10.5%
BB(4,3) 9,401,447 460,916,384 451,514,937 98.0%
BB(3,4) 15,136,283 434,787,751 419,651,468 96.6%
BB(2,6) 870,085 873,469 3384 0.4%
Details