TMBR: August 2025 - Revision history

Sligocki: Reverted edits by Tjligocki (talk) to last revision by Polygon

2025-09-28T19:50:23Z

Reverted edits by Tjligocki (talk) to last revision by Polygon

@@ Line 61: / Line 61: @@
 *John Tromp introduced the <math>BB \lambda _1(n)</math> function for [[Busy Beaver for lambda calculus#Oracle Busy Beaver|Busy Beaver for lambda calculus with an oracle]] and computed it up to <math>BB \lambda _1(22)</math>.
 * Instruction-Limited Greedy Busy Beaver gBBi(n) and an [[Instruction-Limited Busy Beaver#Instruction-Limited Busy Beaver Variants|Instruction-Limited variant]] of the [[Blanking Busy Beaver]] (BLBi(n)) were introduced. gBBi(n) was computed up to n = 13 and BLBi(n) was computed up to n = 7.
 == Misc ==
@@ Line 81: / Line 71: @@
 *@mxdys Introduced "50 Random Holdouts", a thread on the Discord server, where 50 random TMs are selected from the BB(6) holdout list, and everybody focuses on these 50 machines. This month, 6/50 TMs were solved by @mxdys single-handedly.
 *The community (especially, Andrew Ducharme) [https://discord.com/channels/960643023006490684/992572017683472514/1408559249067479145 proposed a concept "BB(n,m) month",] where the community mainly focuses on a single domain, i.e. BB(3,3). The motive of this focused month is to make genuine progress in the one selected domain, with the ultimate goal to reduce all holdouts to [[Cryptids]], with all remaining TMs having been proven in Rocq.
 [[Category:This Month in Beaver Research|2025-08]]

Tjligocki: Moved the two sections after "Misc" to above it.

2025-09-28T19:36:37Z

Moved the two sections after "Misc" to above it.

@@ Line 61: / Line 61: @@
 *John Tromp introduced the <math>BB \lambda _1(n)</math> function for [[Busy Beaver for lambda calculus#Oracle Busy Beaver|Busy Beaver for lambda calculus with an oracle]] and computed it up to <math>BB \lambda _1(22)</math>.
 * Instruction-Limited Greedy Busy Beaver gBBi(n) and an [[Instruction-Limited Busy Beaver#Instruction-Limited Busy Beaver Variants|Instruction-Limited variant]] of the [[Blanking Busy Beaver]] (BLBi(n)) were introduced. gBBi(n) was computed up to n = 13 and BLBi(n) was computed up to n = 7.
 == Misc ==
@@ Line 71: / Line 81: @@
 *@mxdys Introduced "50 Random Holdouts", a thread on the Discord server, where 50 random TMs are selected from the BB(6) holdout list, and everybody focuses on these 50 machines. This month, 6/50 TMs were solved by @mxdys single-handedly.
 *The community (especially, Andrew Ducharme) [https://discord.com/channels/960643023006490684/992572017683472514/1408559249067479145 proposed a concept "BB(n,m) month",] where the community mainly focuses on a single domain, i.e. BB(3,3). The motive of this focused month is to make genuine progress in the one selected domain, with the ultimate goal to reduce all holdouts to [[Cryptids]], with all remaining TMs having been proven in Rocq.
 [[Category:This Month in Beaver Research|2025-08]]

Polygon: /* Holdouts */ Added holdout with wiki-entry being solved

2025-09-22T18:22:06Z

Holdouts: Added holdout with wiki-entry being solved

← Older revision		Revision as of 18:22, 22 September 2025
Line 52:		Line 52:
	** Peacemaker shared a list of BB(6) holdouts and how many steps are required to use all defined transitions. https://discord.com/channels/960643023006490684/1239205785913790465/1410437756777398344		** Peacemaker shared a list of BB(6) holdouts and how many steps are required to use all defined transitions. https://discord.com/channels/960643023006490684/1239205785913790465/1410437756777398344
	** @mxdys shared a list of 7 holdouts that he solved using [https://github.com/ccz181078/busycoq/blob/b1e53d74e5053c3379645aaf75fa8c7a72d00547/verify/RWLAcc.v his RWLAcc decider in Rocq] (previously known as Coq). https://discord.com/channels/960643023006490684/1239205785913790465/1408304281039409212 He also shared results featuring 6 holdouts that were solved in "50 Random Holdouts", see https://discord.com/channels/960643023006490684/1400456788955893840/1409115537631613020		** @mxdys shared a list of 7 holdouts that he solved using [https://github.com/ccz181078/busycoq/blob/b1e53d74e5053c3379645aaf75fa8c7a72d00547/verify/RWLAcc.v his RWLAcc decider in Rocq] (previously known as Coq). https://discord.com/channels/960643023006490684/1239205785913790465/1408304281039409212 He also shared results featuring 6 holdouts that were solved in "50 Random Holdouts", see https://discord.com/channels/960643023006490684/1400456788955893840/1409115537631613020
	** On August 30, @mxdys shared the [https://wiki.bbchallenge.org/wiki/Holdouts_lists#Downloadable_Holdout_Lists new holdouts list], consisting of 2,592 TMs. (The additional 110 TMs not listed here were solved by @mxdys using deciders or individual proofs.)		** On August 30, @mxdys shared the [https://wiki.bbchallenge.org/wiki/Holdouts_lists#Downloadable_Holdout_Lists new holdouts list], consisting of 2,592 TMs. (The additional 110 TMs not listed here were solved by @mxdys using deciders or individual proofs, among these solved holdouts was {{TM\|1RB1LF_1LB1LC_1RD0LE_---0RB_0RC0LA_1RC0RF}})
	*After the [[BB(7)#Phase 1\|enumeration of BB(7)]] was completed, Andrew Ducharme ran [[BB(7)#Phase 2\|several deciders]] on the holdouts list, filtering the original 86,129,304 holdouts down to 59,727,905 in 10 days. https://drive.google.com/drive/u/0/folders/17U0BRpJHTMLtB0poBlOSZhGGp4FkCHIO		*After the [[BB(7)#Phase 1\|enumeration of BB(7)]] was completed, Andrew Ducharme ran [[BB(7)#Phase 2\|several deciders]] on the holdouts list, filtering the original 86,129,304 holdouts down to 59,727,905 in 10 days. https://drive.google.com/drive/u/0/folders/17U0BRpJHTMLtB0poBlOSZhGGp4FkCHIO
	*[[BB(3,3)\|BB(3,3):]] 9 holdouts were proven non-halting in Rocq (previously known as Coq) by mxdys. [https://wiki.bbchallenge.org/wiki/BB(3,3)#Holdouts 10 holdouts remain, 4 of them solved with moderate rigor.] https://discord.com/channels/960643023006490684/1259770474897080380/1410308974275985428		*[[BB(3,3)\|BB(3,3):]] 9 holdouts were proven non-halting in Rocq (previously known as Coq) by mxdys. [https://wiki.bbchallenge.org/wiki/BB(3,3)#Holdouts 10 holdouts remain, 4 of them solved with moderate rigor.] https://discord.com/channels/960643023006490684/1259770474897080380/1410308974275985428

Polygon: /* Holdouts */ Added point

2025-09-09T09:13:03Z

Holdouts: Added point

← Older revision		Revision as of 09:13, 9 September 2025
Line 20:		Line 20:

	== Holdouts ==		== Holdouts ==
	In August there were significant reductions in [[Holdouts lists]] across many [[BB Domains]]		In August there were significant reductions in [[Holdouts lists]] across many [[BB Domains]].
	{\| class="wikitable"		{\| class="wikitable"
	\|+BB Holdout Reduction by Domain		\|+BB Holdout Reduction by Domain

Sligocki: Add fancy TMBR nav template

2025-09-05T03:15:55Z

Add fancy TMBR nav template

← Older revision		Revision as of 03:15, 5 September 2025
Line 1:		Line 1:
	~~< [[TMBR:~~ July 2025]] \| ~~[[TMBR:~~ September 2025~~]] >~~[[File:Conference poster for DNA31 by Tristan Stérin.png\|thumb\|396x396px\|Conference poster for the [https://dna31.sciencesconf.org/ 31st International Conference on DNA Computing and Molecular Programming], [https://discord.com/channels/960643023006490684/960643023530762341/1409904231468761159 made by Tristan Stérin (cosmo)]]]		{{TMBRnav\|July 2025\|September 2025}}
			[[File:Conference poster for DNA31 by Tristan Stérin.png\|thumb\|396x396px\|Conference poster for the [https://dna31.sciencesconf.org/ 31st International Conference on DNA Computing and Molecular Programming], [https://discord.com/channels/960643023006490684/960643023530762341/1409904231468761159 made by Tristan Stérin (cosmo)]]]

	[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for August 2025. This month, [[User:Cosmo\|Tristan Stérin]] presented a poster (see right) at DNA 31, Ben Brubaker wrote a follow-up BB article in Quanta, there were significant holdouts reduction in numerous domains, a fast algorithm for [[Antihydra]] (and similar Collatz-like problems) was re-discovered, and multisymbol support was added to the Blaze TM visualizer.		[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for August 2025. This month, [[User:Cosmo\|Tristan Stérin]] presented a poster (see right) at DNA 31, Ben Brubaker wrote a follow-up BB article in Quanta, there were significant holdouts reduction in numerous domains, a fast algorithm for [[Antihydra]] (and similar Collatz-like problems) was re-discovered, and multisymbol support was added to the Blaze TM visualizer.

ADucharme: navbar edit

2025-09-05T02:55:25Z

navbar edit

← Older revision		Revision as of 02:55, 5 September 2025
Line 1:		Line 1:
	< [[TMBR: July 2025]]: [[TMBR: September 2025]] >[[File:Conference poster for DNA31 by Tristan Stérin.png\|thumb\|396x396px\|Conference poster for the [https://dna31.sciencesconf.org/ 31st International Conference on DNA Computing and Molecular Programming], [https://discord.com/channels/960643023006490684/960643023530762341/1409904231468761159 made by Tristan Stérin (cosmo)]]]		< [[TMBR: July 2025]] \| [[TMBR: September 2025]] >[[File:Conference poster for DNA31 by Tristan Stérin.png\|thumb\|396x396px\|Conference poster for the [https://dna31.sciencesconf.org/ 31st International Conference on DNA Computing and Molecular Programming], [https://discord.com/channels/960643023006490684/960643023530762341/1409904231468761159 made by Tristan Stérin (cosmo)]]]

	[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for August 2025. This month, [[User:Cosmo\|Tristan Stérin]] presented a poster (see right) at DNA 31, Ben Brubaker wrote a follow-up BB article in Quanta, there were significant holdouts reduction in numerous domains, a fast algorithm for [[Antihydra]] (and similar Collatz-like problems) was re-discovered, and multisymbol support was added to the Blaze TM visualizer.		[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for August 2025. This month, [[User:Cosmo\|Tristan Stérin]] presented a poster (see right) at DNA 31, Ben Brubaker wrote a follow-up BB article in Quanta, there were significant holdouts reduction in numerous domains, a fast algorithm for [[Antihydra]] (and similar Collatz-like problems) was re-discovered, and multisymbol support was added to the Blaze TM visualizer.

Sligocki: Link a few users.

2025-09-04T20:51:08Z

Link a few users.

Sligocki: Move Quanta article up to top and mention in openner.

2025-09-04T20:47:48Z

Move Quanta article up to top and mention in openner.

← Older revision		Revision as of 20:47, 4 September 2025
Line 1:		Line 1:
	< [[TMBR: July 2025]]: [[TMBR: September 2025]] >[[File:Conference poster for DNA31 by Tristan Stérin.png\|thumb\|396x396px\|Conference poster for the [https://dna31.sciencesconf.org/ 31st International Conference on DNA Computing and Molecular Programming], [https://discord.com/channels/960643023006490684/960643023530762341/1409904231468761159 made by Tristan Stérin (cosmo)]]]		< [[TMBR: July 2025]]: [[TMBR: September 2025]] >[[File:Conference poster for DNA31 by Tristan Stérin.png\|thumb\|396x396px\|Conference poster for the [https://dna31.sciencesconf.org/ 31st International Conference on DNA Computing and Molecular Programming], [https://discord.com/channels/960643023006490684/960643023530762341/1409904231468761159 made by Tristan Stérin (cosmo)]]]

	[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for August 2025. This month, Tristan Stérin presented a poster (see right) at DNA 31, there were significant holdouts reduction in numerous domains, a fast algorithm for Antihydra (and similar Collatz-like problems) was re-discovered, and multisymbol support was added to the Blaze TM visualizer.		[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for August 2025. This month, Tristan Stérin presented a poster (see right) at DNA 31, Ben Brubaker wrote a follow-up BB article in Quanta, there were significant holdouts reduction in numerous domains, a fast algorithm for Antihydra (and similar Collatz-like problems) was re-discovered, and multisymbol support was added to the Blaze TM visualizer.

	The official [[bbchallenge]] [[BB(5)]] paper "Determination of the fifth Busy Beaver value" has reached [https://github.com/bbchallenge/bbchallenge-paper/blob/build-paper-pdf/bbchallenge-paper.pdf v0.99] and v1.0 will be posted to Arxiv in the first week or two of September.		The official [[bbchallenge]] [[BB(5)]] paper "Determination of the fifth Busy Beaver value" has reached [https://github.com/bbchallenge/bbchallenge-paper/blob/build-paper-pdf/bbchallenge-paper.pdf v0.99] and v1.0 will be posted to Arxiv in the first week or two of September.

	An early announcement: October will be [[BB(3,3)]] month. This is a first test of the idea of "themed focus months". The idea is to encourage broad research focus into the BB(3,3) domain to reduce or describe holdouts more deeply, spread understanding of some of the most complex TMs and analysis techniques, etc. More information will come in next month's TMBR.		An early announcement: October will be [[BB(3,3)]] month. This is a first test of the idea of "themed focus months". The idea is to encourage broad research focus into the BB(3,3) domain to reduce or describe holdouts more deeply, spread understanding of some of the most complex TMs and analysis techniques, etc. More information will come in next month's TMBR.

			== In the News ==
			* 22 Aug 2025. Ben Brubaker. Quanta Magazine. [https://www.quantamagazine.org/busy-beaver-hunters-reach-numbers-that-overwhelm-ordinary-math-20250822/ Busy Beaver Hunters Reach Numbers That Overwhelm Ordinary Math].

	== Cryptids ==		== Cryptids ==
Line 70:		Line 73:
	==Blog Posts==		==Blog Posts==
	* 1 Sep 2025. Katelyn Doucette. [https://katelyndoucette.com/articles/all-about-space-needle All About Space Needle].		* 1 Sep 2025. Katelyn Doucette. [https://katelyndoucette.com/articles/all-about-space-needle All About Space Needle].

	~~==In the News==~~
	* 22 Aug 2025. Ben Brubaker. Quanta Magazine. [https://www.quantamagazine.org/busy-beaver-hunters-reach-numbers-that-overwhelm-ordinary-math-20250822/ Busy Beaver Hunters Reach Numbers That Overwhelm Ordinary Math].

	==Interesting TMs==		==Interesting TMs==

ADucharme: mock-up of automatic pointer to adjacent TMBRs

2025-09-04T00:51:08Z

mock-up of automatic pointer to adjacent TMBRs

← Older revision		Revision as of 00:51, 4 September 2025
Line 1:		Line 1:
	[[File:Conference poster for DNA31 by Tristan Stérin.png\|thumb\|396x396px\|Conference poster for the [https://dna31.sciencesconf.org/ 31st International Conference on DNA Computing and Molecular Programming], [https://discord.com/channels/960643023006490684/960643023530762341/1409904231468761159 made by Tristan Stérin (cosmo)]]]		< [[TMBR: July 2025]]: [[TMBR: September 2025]] >[[File:Conference poster for DNA31 by Tristan Stérin.png\|thumb\|396x396px\|Conference poster for the [https://dna31.sciencesconf.org/ 31st International Conference on DNA Computing and Molecular Programming], [https://discord.com/channels/960643023006490684/960643023530762341/1409904231468761159 made by Tristan Stérin (cosmo)]]]

	[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for August 2025. This month, Tristan Stérin presented a poster (see right) at DNA 31, there were significant holdouts reduction in numerous domains, a fast algorithm for Antihydra (and similar Collatz-like problems) was re-discovered, and multisymbol support was added to the Blaze TM visualizer.		[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for August 2025. This month, Tristan Stérin presented a poster (see right) at DNA 31, there were significant holdouts reduction in numerous domains, a fast algorithm for Antihydra (and similar Collatz-like problems) was re-discovered, and multisymbol support was added to the Blaze TM visualizer.

Sligocki: Add Wade's ZF result

2025-09-03T16:45:53Z

Add Wade's ZF result

← Older revision		Revision as of 16:45, 3 September 2025
Line 12:		Line 12:
	* Shawn Ligocki simulated {{TM\|1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC}} out to one additional Collatz reset, demonstrating that (if they halt, which they probviously should) they will have sigma scores <math>> 10^{10^{10^7}}</math>.		* Shawn Ligocki simulated {{TM\|1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC}} out to one additional Collatz reset, demonstrating that (if they halt, which they probviously should) they will have sigma scores <math>> 10^{10^{10^7}}</math>.
	This algorithm has near linear runtime (in the number of iterations simulated), but also linear memory growth since the parameters grow exponentially. This memory limit seems to be the main bottleneck to simulating Antihydra and other Consistent Collatz iterations further. There has been some discussion on more efficient memory usage or a distributed algorithm to support further scaling, but no results are available yet.		This algorithm has near linear runtime (in the number of iterations simulated), but also linear memory growth since the parameters grow exponentially. This memory limit seems to be the main bottleneck to simulating Antihydra and other Consistent Collatz iterations further. There has been some discussion on more efficient memory usage or a distributed algorithm to support further scaling, but no results are available yet.

			Andrew Wade claims to have proven that BB(432) is [[Independence from ZFC\|independent of ZF]]. https://codeberg.org/ajwade/turing_machine_explorer

	== Holdouts ==		== Holdouts ==

← Older revision		Revision as of 03:15, 5 September 2025
Line 1:		Line 1:
	~~< [[TMBR:~~ July 2025]] \| ~~[[TMBR:~~ September 2025~~]] >~~[[File:Conference poster for DNA31 by Tristan Stérin.png\|thumb\|396x396px\|Conference poster for the [https://dna31.sciencesconf.org/ 31st International Conference on DNA Computing and Molecular Programming], [https://discord.com/channels/960643023006490684/960643023530762341/1409904231468761159 made by Tristan Stérin (cosmo)]]]		{{TMBRnav\|July 2025\|September 2025}}
			[[File:Conference poster for DNA31 by Tristan Stérin.png\|thumb\|396x396px\|Conference poster for the [https://dna31.sciencesconf.org/ 31st International Conference on DNA Computing and Molecular Programming], [https://discord.com/channels/960643023006490684/960643023530762341/1409904231468761159 made by Tristan Stérin (cosmo)]]]

	[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for August 2025. This month, [[User:Cosmo\|Tristan Stérin]] presented a poster (see right) at DNA 31, Ben Brubaker wrote a follow-up BB article in Quanta, there were significant holdouts reduction in numerous domains, a fast algorithm for [[Antihydra]] (and similar Collatz-like problems) was re-discovered, and multisymbol support was added to the Blaze TM visualizer.		[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for August 2025. This month, [[User:Cosmo\|Tristan Stérin]] presented a poster (see right) at DNA 31, Ben Brubaker wrote a follow-up BB article in Quanta, there were significant holdouts reduction in numerous domains, a fast algorithm for [[Antihydra]] (and similar Collatz-like problems) was re-discovered, and multisymbol support was added to the Blaze TM visualizer.

← Older revision		Revision as of 20:51, 4 September 2025
Line 1:		Line 1:
	< [[TMBR: July 2025]]: [[TMBR: September 2025]] >[[File:Conference poster for DNA31 by Tristan Stérin.png\|thumb\|396x396px\|Conference poster for the [https://dna31.sciencesconf.org/ 31st International Conference on DNA Computing and Molecular Programming], [https://discord.com/channels/960643023006490684/960643023530762341/1409904231468761159 made by Tristan Stérin (cosmo)]]]		< [[TMBR: July 2025]]: [[TMBR: September 2025]] >[[File:Conference poster for DNA31 by Tristan Stérin.png\|thumb\|396x396px\|Conference poster for the [https://dna31.sciencesconf.org/ 31st International Conference on DNA Computing and Molecular Programming], [https://discord.com/channels/960643023006490684/960643023530762341/1409904231468761159 made by Tristan Stérin (cosmo)]]]

	[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for August 2025. This month, Tristan Stérin presented a poster (see right) at DNA 31, Ben Brubaker wrote a follow-up BB article in Quanta, there were significant holdouts reduction in numerous domains, a fast algorithm for Antihydra (and similar Collatz-like problems) was re-discovered, and multisymbol support was added to the Blaze TM visualizer.		[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for August 2025. This month, [[User:Cosmo\|Tristan Stérin]] presented a poster (see right) at DNA 31, Ben Brubaker wrote a follow-up BB article in Quanta, there were significant holdouts reduction in numerous domains, a fast algorithm for [[Antihydra]] (and similar Collatz-like problems) was re-discovered, and multisymbol support was added to the Blaze TM visualizer.

	The official [[bbchallenge]] [[BB(5)]] paper "Determination of the fifth Busy Beaver value" has reached [https://github.com/bbchallenge/bbchallenge-paper/blob/build-paper-pdf/bbchallenge-paper.pdf v0.99] and v1.0 will be posted to Arxiv in the first week or two of September.		The official [[bbchallenge]] [[BB(5)]] paper "Determination of the fifth Busy Beaver value" has reached [https://github.com/bbchallenge/bbchallenge-paper/blob/build-paper-pdf/bbchallenge-paper.pdf v0.99] and v1.0 will be posted to Arxiv in the first week or two of September.
Line 13:		Line 13:
	A fast algorithm for [[Consistent Collatz]] simulation was re-discovered and popularized. Using it:		A fast algorithm for [[Consistent Collatz]] simulation was re-discovered and popularized. Using it:
	* apgoucher simulated [[Antihydra]] to <math>2^{38}</math> iterations. This is actually a result from one year ago, but was rediscovered and added to the wiki. https://discord.com/channels/960643023006490684/1026577255754903572/1271528180246773883		* apgoucher simulated [[Antihydra]] to <math>2^{38}</math> iterations. This is actually a result from one year ago, but was rediscovered and added to the wiki. https://discord.com/channels/960643023006490684/1026577255754903572/1271528180246773883
	* Shawn Ligocki simulated {{TM\|1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC}} out to one additional Collatz reset, demonstrating that (if they halt, which they probviously should) they will have sigma scores <math>> 10^{10^{10^7}}</math>.		* [[User:Sligocki\|Shawn Ligocki]] simulated {{TM\|1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC}} out to one additional Collatz reset, demonstrating that (if they halt, which they probviously should) they will have sigma scores <math>> 10^{10^{10^7}}</math>.
	This algorithm has near linear runtime (in the number of iterations simulated), but also linear memory growth since the parameters grow exponentially. This memory limit seems to be the main bottleneck to simulating Antihydra and other Consistent Collatz iterations further. There has been some discussion on more efficient memory usage or a distributed algorithm to support further scaling, but no results are available yet.		This algorithm has near linear runtime (in the number of iterations simulated), but also linear memory growth since the parameters grow exponentially. This memory limit seems to be the main bottleneck to simulating Antihydra and other Consistent Collatz iterations further. There has been some discussion on more efficient memory usage or a distributed algorithm to support further scaling, but no results are available yet.

Line 47:		Line 47:
	\|}		\|}
	* [[BB(6)]] holdouts: Reduced by a total of 136 holdouts by 4 people.		* [[BB(6)]] holdouts: Reduced by a total of 136 holdouts by 4 people.
	** XnoobSpeakable found 9 new halting TMs in the high exponential runtime range (~<math>10^{100000}</math>) by running Enumerate.py out to extremely high parameters. https://discord.com/channels/960643023006490684/1239205785913790465/1401470301467836556		** [[User:XnoobSpeakable\|XnoobSpeakable]] found 9 new halting TMs in the high exponential runtime range (~<math>10^{100000}</math>) by running Enumerate.py out to extremely high parameters. https://discord.com/channels/960643023006490684/1239205785913790465/1401470301467836556
	** [https://discord.com/channels/960643023006490684/1239205785913790465/1407580922831831152 Andrew Ducharme found a surprisingly short running halting TM] in the [[BB(6)]] holdouts list with runtime ~<math>10^{78}</math>, to which [https://discord.com/channels/960643023006490684/1239205785913790465/1407659104910053387 Peacemaker replied with another TM] that was almost identical, and soon, simulation showed it to halt in the same number of steps. Later on the 28th, [https://discord.com/channels/960643023006490684/1239205785913790465/1410465964528504872 Ducharme found another one] with surprisingly low runtime: ~<math>10^{11}</math>. In response, [https://discord.com/channels/960643023006490684/1239205785913790465/1410475867200815114 Peacemaker found an almost identical machine], which also halts with similar runtime.		** [https://discord.com/channels/960643023006490684/1239205785913790465/1407580922831831152 Andrew Ducharme found a surprisingly short running halting TM] in the [[BB(6)]] holdouts list with runtime ~<math>10^{78}</math>, to which [https://discord.com/channels/960643023006490684/1239205785913790465/1407659104910053387 Peacemaker replied with another TM] that was almost identical, and soon, simulation showed it to halt in the same number of steps. Later on the 28th, [https://discord.com/channels/960643023006490684/1239205785913790465/1410465964528504872 Ducharme found another one] with surprisingly low runtime: ~<math>10^{11}</math>. In response, [https://discord.com/channels/960643023006490684/1239205785913790465/1410475867200815114 Peacemaker found an almost identical machine], which also halts with similar runtime.
	** Peacemaker shared a list of BB(6) holdouts and how many steps are required to use all defined transitions. https://discord.com/channels/960643023006490684/1239205785913790465/1410437756777398344		** Peacemaker shared a list of BB(6) holdouts and how many steps are required to use all defined transitions. https://discord.com/channels/960643023006490684/1239205785913790465/1410437756777398344