* [[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 its 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 its runtime was not known at the time.
* @Peacemaker II verified the [[BB(6)]] champion {{TM|1RB1RA_1RC1RZ_1LD0RF_1RA0LE_0LD1RC_1RA0RE}} (and the other members of its "family") and calculated a more precise [[sigma score]] of 10↑↑10↑↑10↑↑8.10237 for it. https://discord.com/channels/960643023006490684/1387426381041893417/1429556125539369040
* @zts439 proved that [[Bug]](8,8) = 506. https://discord.com/channels/960643023006490684/1362008236118511758/1423502208422510716
* @zts439 proved that [[Bug]](8,8) = 506. https://discord.com/channels/960643023006490684/1362008236118511758/1423502208422510716
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).
@Bard proved that 3 dimension PAF are Turing complete.[1]
@star proved that 2 dimension PAF are Turing complete.[2][3]
Shawn Ligocki wrote up a proof sketch that 2-region PAF are Turing complete.[4]
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.
This introduces a new type of Cryptids separate from previous Collatz-like ones.
Deciders
Inductive deciders
-d rewrote quick_sim.py in C++, achieving a 6-10x faster runtime.[5][6]
Katelyn Douchette is working on an automated inductive decider.[7][8] (see inductive proofs)
Misc
Design for a disk to physically simulate Antihydra.3d printed version of Antihydra disk.@coda shared a mechanical implementation of a Turing Machine, Antihydra.[9] @zts439 3d-printed a prototype (see image at right).[10]
@mxdys shared a new holdouts list on October 20th, consisting of 1618 machines up to equivalence, or 3067 individual machines. This means 73 newly solved machines, a 4% reduction.
Andrew Ducharme has continued reducing the number of holdouts with Stage 4 of Phase 2. Afterwards, Terry Ligocki ran Stage 5 of Phase 2. Initially, in the beginning of the month there were 22,801,601 holdouts, and 20,405,295 holdouts remain. (10.51% reduction)