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).
On August 2, Discord user creeperman7002 discovered a new step and score champion for TT(3,3), 1PB2PA0PC_2TB1PC2PB_2PB1PZ0PA, running for 715,764,479 steps.[1]
On August 8, Discord user creeperman7002 discovered a new step champion for TT(3,3), 1PB0TC1PA_2PC1PZ2PA_2TC0PA2PC, running for 2.27 × 10248 steps.[2]
On August 11, Discord user creeperman7002 released a TT(3,3) holdouts list consisting of 19,368 holdouts.[3]
On August 6, Δ⁵ discovered a new champion for Ξ₀SK(16).[4]
On the same day, Δ⁵ discovered a new champion for Ξ₀BCKW(6).[5]
On August 14, Δ⁵ discovered another new champion for Ξ₀SK(16).[6]
On August 20, Δ⁵ discovered new hexational champions for Ξ₀(17), Ξ₀(18), and Ξ₀(19) in the SKI calculus, and Ξ₀SK(23), Ξ₀SK(24), and Ξ₀SK(25) in the SK calculus.[7]
On the same day, Δ⁵ discovered another new champion for Ξ₀SK(25).[8]
AlephSquirrel has found a 9-pebble automaton running for 63,577 steps which iterates a Collatz-like function; the first 200 steps are displayed here, with colors corresponding to the numbers of pebbles in a single cell. (Image source: AlephSquirrel)
On August 8, AlephSquirrel introduced the Busy Beaver function for Pebble Automata, peBBle(n), proving the values of peBBle(n) for sizes 1 to 3.[9]
On the same day, sheep discovered an infinite family of automata, including the champion for peBBle(4).[10]
On August 9, AlephSquirrel discovered a new champion for peBBle(5).[11]
On August 10, Deccy discovered a new champion for peBBle(6)[12]
On August 11, Deccy discovered a new champion for peBBle(7).[13]
On August 13, mathmasterzach discovered 3 new peBBle(8) champions in quick succession,[14][15][16] and the previous peBBle(9) champion, which ran for 323 steps.[17]
On August 16, AlephSquirrel proved the peBBle(4) champion to be optimal.[18]
On August 17, AlephSquirrel tweaked the peBBle(9) champion to run for 63577 steps.[19]
On August 12, Shawn Ligocki extracted new bounds for BBdio(n) for heights 40, 48, 57, and 66, based on work done in the sums of three cubes problem.[20][21]
On the same day, Shawn Ligocki suggested calling the equation , and similar equations from the sums of three cubes problem, Cryptids,[22][23] though their classification was later changed to that of energy vampire,[24] following an objection by sheep,[25][26] who favored calling them "energy vampired [sic]",[27] as they are expected to be solvable in practice, though may be computationally hard to find solutions for.[28]
On August 14, Shawn Ligocki rediscoveredpapers (and a post on StackExchange) from Bogdan Grechuk that imply BBdio(29) > 106,[29] and that BBdio(31) is decidable.[30]
On August 23, star discovered the height 78 equation , which is expected to not have any solutions, but may be very difficult to prove.[31]. She also discovered the height 135 equation ,[32] which is also expected to not have any solutions, but may be difficult to prove, in much the same way that the sums of three cubes problem is hard.
On August 13, Azerty made a size 16 program which returns the nth Fibonacci number.[33]
On August 15, sheep made a size 35 program that tests the primality of a number.[34]
On August 24, sheep discovered a set of Collatz-like programs,[35] some of which simulate random unbiased walks.[36][37][38] However, they are not champions, due to the existence of smaller tetrational and pentational machines.
On the same day, Shawn Ligocki released a personal BBCS(12) holdouts list consisting of 13,580 holdouts, used for direct simulation.[39]
A new champion for BBWT(9) can be obtained from a generalization of sheep's BBWT(7) champion, found this month. This new champion is a set of 9 tiles, which can tile any n×n square up to n = 17, and no larger; tiling rules are denoted by colors, similar to other depictions of Wang tiles. (Image source: sheep)
On August 26, Azerty introduced the Busy Beaver function for Cyclic Tag Systems, BBCT(n),[42] proving the values of BBCT(n) for sizes 1 to 4, and providing lower bounds for BBCT(n) for sizes 1 to 12.[43]
On the same day, sheep rediscovered literature that provided lower bounds for BBCT(n) for sizes 1 to 9.[44]
On August 30, sheep discovered a size 36 Cryptid, showing BBCT(36) is hard.[45]
On August 27, Shawn Ligocki renewed interest in a size 16 chaotic (possibly Cryptid) GRF previously discovered in May,[46] during a discussion on what behaviors should be required to classify a Cryptid.[47]
prurq simulated an impressive 4 holdouts to halting this month; one of the machines simulated, 1RB0LB_0RC1RF 1LD1RE_0LA0RB_0RD0LD_0LE--- (1LD1RE_0LA0RB_0RD0LD_0LE---&status=halt bbch), is shown here in mxdys's Turing Machine simulator using longitudinal analysis, which was used to confirm prurq's result. (Image source: prurq)
On August 3, prurq simulated three machines to halting.[50][51][52]
On August 4, q64 proved another machine halting.[53]
On August 15, Discord user jacobrschwartz proved another TM halting.
On the same day, mxdys released a new holdouts list of 1,016 machines up to equivalence,[54] this is a 4.51% reduction compared to the previous holdouts lists.
On the same day, mxdys, using an LLM, decided 20 machines, with 18 proofs under review.[55]
On August 24, Discord user flintt_6 informally proved another machine halting.[56]
On the same day, mxdys released a list of machines that are easy to accelerate using the UBRRBA decider, consisting of 86 machines.[57]
On August 25, prurq simulated another machine to halting.[58]
On August 26, q64 proved another machine halting.[59]
On August 29, mxdys released another holdouts list of 1,003 machines up to equivalence.[60]
On August 31, mxdys released another holdouts list of 999 machines up to equivalence,[61] breaking the 1,000 holdout barrier.
Terry Ligocki enumerated 150K more subtasks, increasing the number of holdouts to 2,651,060,579. A total of 850K subtasks out of the 1 million subtasks (or 85%) have been enumerated.
