** Andrew Ducharme has continued reducing the [[BB(7)#Phase 2|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)
** Andrew Ducharme has continued reducing the [[BB(7)#Phase 2|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)
* [[BB(4,3)|BB(4,3):]]
* [[BB(4,3)|BB(4,3):]]
**Terry Ligocki has begun [[BB(4,3)#Phase 2|Phase 2 of holdout reduction,]] reducing the number of holdouts from 460,916,384 to 9,401,447. (97.96% reduction)
**Terry Ligocki finished [[BB(4,3)#Phase 2|Phase 2 of holdout reduction,]] reducing the number of holdouts from 460,916,384 to 9,401,447. (97.96% reduction)
*[[BB(3,4)|BB(3,4):]]
*[[BB(3,4)|BB(3,4):]]
**[[User:XnoobSpeakable|XnoobSpeakable]] and [[User:WarpedWartWars|Lúkos]] are running filters in the domain under [[BB(3,4)#Phase 2|Phase 2]], reducing the holdout count from 434,787,751 to 15,136,283. (96.6% reduction)
**[[User:XnoobSpeakable|XnoobSpeakable]] and [[User:WarpedWartWars|Lúkos]] are running filters in the domain under [[BB(3,4)#Phase 2|Phase 2]], reducing the holdout count from 434,787,751 to 15,136,283. (96.6% reduction)
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 is developing a C++ version of Quick_Sim. It can currently solve "Diff Rules" (L1 Inductive Rules). It is 6-10x faster than the original python implementation.[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)
_holdouts_decrease_over_time.png)