BB(2,6) - Revision history

Polygon: /* Stage 4 */ fixed alignment

2026-04-26T09:31:42Z

Stage 4: fixed alignment

← Older revision		Revision as of 09:31, 26 April 2026
Line 1,023:		Line 1,023:
	\| ---		\| ---
	\| ---		\| ---
	\|FAR CPS_LRU maxT 1000000 LRUH [12,16] H [0-2] tH [0-2] n [1-10]		\|style="text-align:left"\|FAR CPS_LRU maxT 1000000 LRUH [12,16] H [0-2] tH [0-2] n [1-10]
	\|-		\|-
	\|556,814		\|556,814

ADucharme: /* Stage 4 */ update 2x6 progress

2026-04-26T06:52:27Z

Stage 4: update 2x6 progress

@@ Line 863: / Line 863: @@
 |5,666.72
 | style="text-align:left" |FAR CPS_LRU maxT 100000 LRUH 2 H 1 tH 1 n 2
-| rowspan="25" |[https://drive.google.com/drive/folders/18njhmOzRc67zCmVuLd0aDxl6ETBhL1gy?usp=sharing Google Drive]
+| rowspan="28" |[https://drive.google.com/drive/folders/18njhmOzRc67zCmVuLd0aDxl6ETBhL1gy?usp=sharing Google Drive]
 |-
 |811,301
@@ Line 1,056: / Line 1,056: @@
 | ---
 |style="text-align:left"|FAR CPS_LRU maxT 1000000 LRUH 6 and 8
 |}

ADucharme: update 2x6 reduction table, google drive

2026-04-05T15:50:22Z

update 2x6 reduction table, google drive

← Older revision		Revision as of 15:50, 5 April 2026
Line 741:		Line 741:
	\| --		\| --
	\|style="text-align:left" \|lr_enum_continue 100_000_000 steps		\|style="text-align:left" \|lr_enum_continue 100_000_000 steps
	\| rowspan="10" \|[https://drive.google.com/drive/folders/1TsSpW27x3LBlu5qmk-cjzCJzgo_3ehyT?usp=drive_link Google Drive]		\| rowspan="11" \|[https://drive.google.com/drive/folders/1TsSpW27x3LBlu5qmk-cjzCJzgo_3ehyT?usp=drive_link Google Drive]
	\|-		\|-
	\| style="text-align:left" \|Andrew Ducharme		\| style="text-align:left" \|Andrew Ducharme
Line 832:		Line 832:
	\|0.06		\|0.06
	\|style="text-align:left"\|Enumerate.py -r --no-steps --exp-linear-rules --max-loops=100_000_000 --block-mult=9 --tape-limit=5000 --max-steps-per-macro=100_000 --lin-steps=0 --no-ctl --force --save-freq=250		\|style="text-align:left"\|Enumerate.py -r --no-steps --exp-linear-rules --max-loops=100_000_000 --block-mult=9 --tape-limit=5000 --max-steps-per-macro=100_000 --lin-steps=0 --no-ctl --force --save-freq=250
	\|
	\|}		\|}
	The total time spent on the lr_enum_continue computation was not recorded.		The total time spent on the lr_enum_continue computation was not recorded.
Line 864:		Line 863:
	\|5,666.72		\|5,666.72
	\| style="text-align:left" \|FAR CPS_LRU maxT 100000 LRUH 2 H 1 tH 1 n 2		\| style="text-align:left" \|FAR CPS_LRU maxT 100000 LRUH 2 H 1 tH 1 n 2
	\| rowspan="21" \|[https://drive.google.com/drive/folders/18njhmOzRc67zCmVuLd0aDxl6ETBhL1gy?usp=sharing Google Drive]		\| rowspan="25" \|[https://drive.google.com/drive/folders/18njhmOzRc67zCmVuLd0aDxl6ETBhL1gy?usp=sharing Google Drive]
	\|-		\|-
	\|811,301		\|811,301
Line 1,021:		Line 1,020:
	\|556,814		\|556,814
	\|0.22%		\|0.22%
	\|~~???~~		\|~14,000
	\| ---		\| ---
	\| ---		\| ---
Line 1,029:		Line 1,028:
	\|554,479		\|554,479
	\|0.42%		\|0.42%
	\|~~???~~		\|~3,600
	\| ---		\| ---
	\| ---		\| ---
	\|style="text-align:left"\|maxT 1000000 LRUH [1-3]		\|style="text-align:left"\|FAR CPS_LRU maxT 1000000 LRUH [1-3]
	\|-		\|-
	\|554,479		\|554,479
	\|551,586		\|551,586
	\|0.52%		\|0.52%
	\|~~???~~		\|~5000
	\| ---		\| ---
	\| ---		\| ---
	\|style="text-align:left"\|maxT 1000000 LRUH 4		\|style="text-align:left"\|FAR CPS_LRU maxT 1000000 LRUH 4
	\|-		\|-
	\|551,586		\|551,586
	\|548,993		\|548,993
	\|0.47%		\|0.47%
	\|~~???~~		\|~13,000
	\| ---		\| ---
	\| ---		\| ---
	\|style="text-align:left"\|maxT 1000000 LRUH 5		\|style="text-align:left"\|FAR CPS_LRU maxT 1000000 LRUH 5
	\|-		\|-
	\|548,993		\|548,993
	\|545,005		\|545,005
	\|0.73%		\|0.73%
	\|~~???~~		\|~57,000
	\| ---		\| ---
	\| ---		\| ---
	\|style="text-align:left"\|maxT 1000000 LRUH 6 and 8		\|style="text-align:left"\|FAR CPS_LRU maxT 1000000 LRUH 6 and 8
	\|}		\|}

Polygon: /* Phase 1 */ discord and the holdouts lists pages say November

2026-03-29T10:55:41Z

Phase 1: discord and the holdouts lists pages say November

← Older revision		Revision as of 10:55, 29 March 2026
Line 94:		Line 94:

	== Phase 1 ==		== Phase 1 ==
	The initial phase of enumeration and reduction of [[holdouts]] took place in ~~December~~ 2024 and was done by Terry Ligocki using the Ligockis' C++ and Python codes. The initial enumerations generated ~24B(illion) TMs of which ~2.278B were holdout TMs. This was reduced to ~22M holdout TMs (a 99.02% reduction). The details are given in this table, including links to the Google Drive with the holdouts and details of the computation:		The initial phase of enumeration and reduction of [[holdouts]] took place in November 2024 and was done by Terry Ligocki using the Ligockis' C++ and Python codes. The initial enumerations generated ~24B(illion) TMs of which ~2.278B were holdout TMs. This was reduced to ~22M holdout TMs (a 99.02% reduction). The details are given in this table, including links to the Google Drive with the holdouts and details of the computation:

	(done to reduce column size:		(done to reduce column size:

Polygon: /* Stage 4 */ added new reduction

2026-03-29T10:37:44Z

Stage 4: added new reduction

← Older revision		Revision as of 10:37, 29 March 2026
Line 1,049:		Line 1,049:
	\| ---		\| ---
	\|style="text-align:left"\|maxT 1000000 LRUH 5		\|style="text-align:left"\|maxT 1000000 LRUH 5
			\|-
			\|548,993
			\|545,005
			\|0.73%
			\|???
			\| ---
			\| ---
			\|style="text-align:left"\|maxT 1000000 LRUH 6 and 8
	\|}		\|}

Polygon: /* Phase 1 */ consistent separators

2026-02-26T15:56:27Z

Phase 1: consistent separators

← Older revision		Revision as of 15:56, 26 February 2026
Line 94:		Line 94:

	== Phase 1 ==		== Phase 1 ==
	The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis' C++ and Python codes. The initial enumerations generated ~24B(illion) TMs of which ~2,278B were holdout TMs. This was reduced to ~22M holdout TMs (a 99.02% reduction). The details are given in this table, including links to the Google Drive with the holdouts and details of the computation:		The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis' C++ and Python codes. The initial enumerations generated ~24B(illion) TMs of which ~2.278B were holdout TMs. This was reduced to ~22M holdout TMs (a 99.02% reduction). The details are given in this table, including links to the Google Drive with the holdouts and details of the computation:

	(done to reduce column size:		(done to reduce column size:

Polygon: /* Stage 4 */ added new reduction

2026-02-26T15:54:39Z

Stage 4: added new reduction

← Older revision		Revision as of 15:54, 26 February 2026
Line 1,041:		Line 1,041:
	\| ---		\| ---
	\|style="text-align:left"\|maxT 1000000 LRUH 4		\|style="text-align:left"\|maxT 1000000 LRUH 4
			\|-
			\|551,586
			\|548,993
			\|0.47%
			\|???
			\| ---
			\| ---
			\|style="text-align:left"\|maxT 1000000 LRUH 5
	\|}		\|}

Polygon: /* Stage 4 */ comma

2026-02-20T19:15:46Z

Stage 4: comma

← Older revision		Revision as of 19:15, 20 February 2026
Line 837:		Line 837:

	=== Stage 4 ===		=== Stage 4 ===
	Following the release of @mxdys's implementation of FAR deciders in C++, these deciders were applied to the 2x6 holdouts by Andrew Ducharme. The details are given in this table. including links to the Google Drive with the holdouts and solved TMs per decider:		Following the release of @mxdys's implementation of FAR deciders in C++, these deciders were applied to the 2x6 holdouts by Andrew Ducharme. The details are given in this table, including links to the Google Drive with the holdouts and solved TMs per decider:

	(done to reduce column size:		(done to reduce column size:

Polygon: /* Stage 4 */ Added two new reductions

2026-02-20T19:07:30Z

Stage 4: Added two new reductions

@@ Line 1,025: / Line 1,025: @@
 | ---
 |FAR CPS_LRU maxT 1000000 LRUH [12,16] H [0-2] tH [0-2] n [1-10]
 |}

Polygon: /* Stage 3 */ updated text, fixed heading level for stage 4

2026-02-18T12:13:46Z

Stage 3: updated text, fixed heading level for stage 4

← Older revision		Revision as of 12:13, 18 February 2026
Line 711:		Line 711:

	=== Stage 3 ===		=== Stage 3 ===
	Starting from the results of Stage 2, Andrew Ducharme ran "lr_enum_continue" with the maximum number of steps set to 100 million, then "Enumerate.py" with various parameters. A total of 8 Enumerate variations were run. The holdouts were reduced from ~970K TMs to ~~~870K~~ TMs (a 10.31% reduction). The details are given in this table, including links to the Google Drive with the holdouts and details of the computation:		Starting from the results of Stage 2, Andrew Ducharme ran "lr_enum_continue" with the maximum number of steps set to 100 million, then "Enumerate.py" with various parameters. A total of 10 Enumerate variations were run. The holdouts were reduced from ~970K TMs to ~867K TMs (a 10.63% reduction). The details are given in this table, including links to the Google Drive with the holdouts and details of the computation:

	(done to reduce column size:		(done to reduce column size:
Line 836:		Line 836:
	The total time spent on the lr_enum_continue computation was not recorded.		The total time spent on the lr_enum_continue computation was not recorded.

	===== Stage 4 =====		=== Stage 4 ===
	Following the release of @mxdys's implementation of FAR deciders in C++, these deciders were applied to the 2x6 holdouts by Andrew Ducharme. The details are given in this table. including links to the Google Drive with the holdouts and solved TMs per decider:		Following the release of @mxdys's implementation of FAR deciders in C++, these deciders were applied to the 2x6 holdouts by Andrew Ducharme. The details are given in this table. including links to the Google Drive with the holdouts and solved TMs per decider: