Talk:Champions - Revision history

Racheline at 18:56, 13 February 2025

2025-02-13T18:56:34Z

← Older revision		Revision as of 18:56, 13 February 2025
Line 43:		Line 43:

	Who can design a [https://googology.fandom.com/wiki/Laver_table Laver table] q function level machine. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 06:57, 13 February 2025 (UTC)		Who can design a [https://googology.fandom.com/wiki/Laver_table Laver table] q function level machine. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 06:57, 13 February 2025 (UTC)

			: Me, probably. This 67-state TM should leave over q<sup>81</sup>(q(5)-2) 1s on the tape (maybe i have an off-by-one or off-by-two error in the exponent of q but it's still iterated quite a few times):
			<pre>
			M = (
			((1, 1, 1), (0, -1, 3)),
			((0, -1, 2), (0, 1, 1)),
			((1, 1, 0), (1, -1, 2)),
			((0, -1, 4), (1, -1, 0)),
			((0, -1, 2), (1, -1, 5)),
			((0, 1, 26), (0, 1, 5)),
			((1, -1, 57), (0, 1, 26)),
			((0, 1, 38), (1, 1, 8)),
			((0, 1, 9), (1, 1, 8)),
			((0, 1, 62), (0, 1, 10)),
			((0, -1, 16), (0, -1, 11)),
			((1, -1, 12), (1, -1, 11)),
			((0, 1, 15), (0, 1, 13)),
			((1, 1, 14), (1, 1, 13)),
			((0, -1, 16), (0, -1, 11)),
			((0, 1, 10), (1, 1, 15)),
			((1, -1, 33), (0, -1, 17)),
			((1, -1, 18), (1, -1, 17)),
			((0, -1, 19), (1, -1, 18)),
			((0, -1, 20), (1, -1, 19)),
			((0, 1, 22), (1, -1, 21)),
			((1, 1, 21), (0, 1, 22)),
			((0, 1, 23), (1, 1, 22)),
			((1, -1, 24), (1, 1, 23)),
			((1, -1, 30), (0, 1, 25)),
			((1, -1, 26), (1, 1, 25)),
			((0, 1, 6), (0, -1, 27)),
			((0, -1, 28), (1, -1, 27)),
			((0, -1, 29), (1, -1, 28)),
			((1, -1, 20), (1, -1, 29)),
			((1, 1, 32), (0, -1, 31)),
			((1, -1, 32), (1, -1, 31)),
			((0, 1, 7), (0, -1, 30)),
			((0, -1, 34), (0, -1, 33)),
			((0, -1, 34), (0, -1, 35)),
			((0, 1, 37), (1, 1, 36)),
			((0, 1, 36), (1, -1, 16)),
			((0, 1, 37), (0, 1, 7)),
			((0, 1, 39), (0, 1, 7)),
			((0, -1, 44), (0, -1, 40)),
			((0, -1, 41), (1, -1, 40)),
			((1, 1, 42), (1, -1, 41)),
			((0, 1, 43), (1, 1, 42)),
			((1, 1, 39), (1, 1, 43)),
			((0, -1, 45), (1, -1, 44)),
			((0, -1, 47), (0, -1, 46)),
			((1, -1, 45), (1, -1, 46)),
			((1, -1, 47), (1, 1, 48)),
			((0, -1, 49), (1, 1, 48)),
			((0, 1, 56), (0, -1, 50)),
			((0, 1, 49), (0, 1, 51)),
			((1, 1, 52), (1, 1, 51)),
			((0, -1, 55), (0, -1, 53)),
			((1, -1, 54), (1, -1, 53)),
			((0, 1, 51), (0, 1, 51)),
			((0, -1, 50), (1, -1, 55)),
			((1, -1, 57), (1, 1, 56)),
			((1, -1, 61), (0, -1, 58)),
			((1, 1, 59), (1, -1, 58)),
			((0, -1, 60), (0, 1, 56)),
			((1, 1, 61), (1, -1, 60)),
			((1, -1, 66), (0, 1, 7)),
			((0, 1, 63), (0, 1, 62)),
			((0, 1, 63), (0, 1, 64)),
			((0, -1, 65), (1, 1, -1)),
			((0, -1, 65), (1, -1, 66)),
			((0, -1, 40), (1, -1, 66))
			)

			(start from state 0)
			</pre>
			: It could probably be optimized a bit more, because there are two parts that do basically the same thing and could probably be joined together, but it would cost a few extra states to then differentiate between which of them it was supposed to be, and i don't have time to do that right now.--[[User:Racheline\|Racheline]] ([[User talk:Racheline\|talk]]) 18:56, 13 February 2025 (UTC)

	== BB(51) epsilon_0 champion ==		== BB(51) epsilon_0 champion ==

Jacobzheng at 06:57, 13 February 2025

2025-02-13T06:57:28Z

← Older revision		Revision as of 06:57, 13 February 2025
Line 42:		Line 42:
	:: '''Edit:''' It turns out CatIsFluffy [https://github.com/CatsAreFluffy/metamath-turing-machines beat me to it]! I don't know how many states the BMS machine has, but [https://cosearch.bbchallenge.org/contribution/m5k4ulm8 BB(1094) > Loader's number], now down to [https://github.com/CatsAreFluffy/metamath-turing-machines/commit/85948b04fc4aeb983ca6d63d6aee5ad6ef308bfe BB(1015)]. [[User:C7X\|C7X]] ([[User talk:C7X\|talk]]) 11:37, 4 October 2024 (UTC)		:: '''Edit:''' It turns out CatIsFluffy [https://github.com/CatsAreFluffy/metamath-turing-machines beat me to it]! I don't know how many states the BMS machine has, but [https://cosearch.bbchallenge.org/contribution/m5k4ulm8 BB(1094) > Loader's number], now down to [https://github.com/CatsAreFluffy/metamath-turing-machines/commit/85948b04fc4aeb983ca6d63d6aee5ad6ef308bfe BB(1015)]. [[User:C7X\|C7X]] ([[User talk:C7X\|talk]]) 11:37, 4 October 2024 (UTC)

	Who can design a [https://googology.fandom.com/wiki/Laver_table Laver table] level machine. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 06:55, 13 February 2025 (UTC)		Who can design a [https://googology.fandom.com/wiki/Laver_table Laver table] q function level machine. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 06:57, 13 February 2025 (UTC)

	== BB(51) epsilon_0 champion ==		== BB(51) epsilon_0 champion ==

Jacobzheng at 06:55, 13 February 2025

2025-02-13T06:55:29Z

← Older revision		Revision as of 06:55, 13 February 2025
Line 41:		Line 41:

	:: '''Edit:''' It turns out CatIsFluffy [https://github.com/CatsAreFluffy/metamath-turing-machines beat me to it]! I don't know how many states the BMS machine has, but [https://cosearch.bbchallenge.org/contribution/m5k4ulm8 BB(1094) > Loader's number], now down to [https://github.com/CatsAreFluffy/metamath-turing-machines/commit/85948b04fc4aeb983ca6d63d6aee5ad6ef308bfe BB(1015)]. [[User:C7X\|C7X]] ([[User talk:C7X\|talk]]) 11:37, 4 October 2024 (UTC)		:: '''Edit:''' It turns out CatIsFluffy [https://github.com/CatsAreFluffy/metamath-turing-machines beat me to it]! I don't know how many states the BMS machine has, but [https://cosearch.bbchallenge.org/contribution/m5k4ulm8 BB(1094) > Loader's number], now down to [https://github.com/CatsAreFluffy/metamath-turing-machines/commit/85948b04fc4aeb983ca6d63d6aee5ad6ef308bfe BB(1015)]. [[User:C7X\|C7X]] ([[User talk:C7X\|talk]]) 11:37, 4 October 2024 (UTC)

			Who can design a [https://googology.fandom.com/wiki/Laver_table Laver table] level machine. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 06:55, 13 February 2025 (UTC)

	== BB(51) epsilon_0 champion ==		== BB(51) epsilon_0 champion ==
Line 120:		Line 122:

	: I have thought about writing a program that searches for Ackermann's worm-like behavior of TMs (or at least a program for exponential behavior), but I wouldn't be sure how to do it. [[User:C7X\|C7X]] ([[User talk:C7X\|talk]]) 22:07, 30 October 2024 (UTC)		: I have thought about writing a program that searches for Ackermann's worm-like behavior of TMs (or at least a program for exponential behavior), but I wouldn't be sure how to do it. [[User:C7X\|C7X]] ([[User talk:C7X\|talk]]) 22:07, 30 October 2024 (UTC)

	~~Who can design a <math>\psi(\varepsilon_{\Omega+1})</math> level machine. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 05:24, 8 December 2024 (UTC)~~

	== Cloud search for busy beavers ==		== Cloud search for busy beavers ==

Konkhra: /* Cloud search for busy beavers */

2024-12-16T06:10:30Z

Cloud search for busy beavers

← Older revision		Revision as of 06:10, 16 December 2024
Line 131:		Line 131:

	: Certainly it could do something like direct simulation quickly, but is there a known way to automate more advanced techniques to look for long-running machines? [[User:C7X\|C7X]] ([[User talk:C7X\|talk]]) 22:17, 15 December 2024 (UTC)		: Certainly it could do something like direct simulation quickly, but is there a known way to automate more advanced techniques to look for long-running machines? [[User:C7X\|C7X]] ([[User talk:C7X\|talk]]) 22:17, 15 December 2024 (UTC)
			::questions like these should be asked on discord. Few people look at this page.--[[User:Konkhra\|Konkhra]] ([[User talk:Konkhra\|talk]]) 06:10, 16 December 2024 (UTC)

C7X: /* Cloud search for busy beavers */

2024-12-15T22:17:50Z

Cloud search for busy beavers

← Older revision		Revision as of 22:17, 15 December 2024
Line 129:		Line 129:

	It may be able to search the busy beaver domain BB(7) or even larger more quickly. [[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 13:38, 15 December 2024 (UTC)		It may be able to search the busy beaver domain BB(7) or even larger more quickly. [[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 13:38, 15 December 2024 (UTC)

			: Certainly it could do something like direct simulation quickly, but is there a known way to automate more advanced techniques to look for long-running machines? [[User:C7X\|C7X]] ([[User talk:C7X\|talk]]) 22:17, 15 December 2024 (UTC)

Jacobzheng at 13:38, 15 December 2024

2024-12-15T13:38:56Z

← Older revision		Revision as of 13:38, 15 December 2024
Line 127:		Line 127:

	: In the case of distributed computing projects like Catalogue and Great Internet Mersenne Prime Search, it seems like those are distributed to divvy up a large finite amount of computation. I don't know much about searching for Busy Beavers (e.g. if there is such a thing as an automated process for finding accelerated simulators) but would distributed finite computation be able to help reduce holdout lists? [[User:C7X\|C7X]] ([[User talk:C7X\|talk]]) 09:05, 15 December 2024 (UTC)		: In the case of distributed computing projects like Catalogue and Great Internet Mersenne Prime Search, it seems like those are distributed to divvy up a large finite amount of computation. I don't know much about searching for Busy Beavers (e.g. if there is such a thing as an automated process for finding accelerated simulators) but would distributed finite computation be able to help reduce holdout lists? [[User:C7X\|C7X]] ([[User talk:C7X\|talk]]) 09:05, 15 December 2024 (UTC)

			It may be able to search the busy beaver domain BB(7) or even larger more quickly. [[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 13:38, 15 December 2024 (UTC)

C7X: /* Cloud search for busy beavers */

2024-12-15T09:05:44Z

Cloud search for busy beavers

← Older revision		Revision as of 09:05, 15 December 2024
Line 125:		Line 125:
	== Cloud search for busy beavers ==		== Cloud search for busy beavers ==
	We still lack a website for cloud search busy beaver functions. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 07:07, 15 December 2024 (UTC)		We still lack a website for cloud search busy beaver functions. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 07:07, 15 December 2024 (UTC)

			: In the case of distributed computing projects like Catalogue and Great Internet Mersenne Prime Search, it seems like those are distributed to divvy up a large finite amount of computation. I don't know much about searching for Busy Beavers (e.g. if there is such a thing as an automated process for finding accelerated simulators) but would distributed finite computation be able to help reduce holdout lists? [[User:C7X\|C7X]] ([[User talk:C7X\|talk]]) 09:05, 15 December 2024 (UTC)

C7X: Split into new section /* BB(51) epsilon_0 champion */

2024-12-15T09:00:38Z

Split into new section BB(51) epsilon_0 champion

← Older revision		Revision as of 09:00, 15 December 2024
Line 123:		Line 123:
	Who can design a <math>\psi(\varepsilon_{\Omega+1})</math> level machine. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 05:24, 8 December 2024 (UTC)		Who can design a <math>\psi(\varepsilon_{\Omega+1})</math> level machine. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 05:24, 8 December 2024 (UTC)

			== Cloud search for busy beavers ==
	We still lack a website for cloud search busy beaver functions. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 07:07, 15 December 2024 (UTC)		We still lack a website for cloud search busy beaver functions. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 07:07, 15 December 2024 (UTC)

Jacobzheng at 07:07, 15 December 2024

2024-12-15T07:07:28Z

← Older revision		Revision as of 07:07, 15 December 2024
Line 122:		Line 122:

	Who can design a <math>\psi(\varepsilon_{\Omega+1})</math> level machine. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 05:24, 8 December 2024 (UTC)		Who can design a <math>\psi(\varepsilon_{\Omega+1})</math> level machine. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 05:24, 8 December 2024 (UTC)

			We still lack a website for cloud search busy beaver functions. --[[User:Jacobzheng\|Jacobzheng]] ([[User talk:Jacobzheng\|talk]]) 07:07, 15 December 2024 (UTC)

Konkhra: /* Self-Reporting and Verification */

2024-12-12T01:53:31Z

Self-Reporting and Verification

← Older revision		Revision as of 01:53, 12 December 2024
Line 1:		Line 1:
	== Self-Reporting and Verification ==		== Self-Reporting and Verification ==
	This champions page has ended up with a lot of self reported and (I assume) not independently verified champions. I'm conflicted about this: On the one hand I want this wiki to have an encyclopedic/Wikipedia style: it would include things which are known, established and verified. On the other hand, I don't want to stifle innovation or gatekeep what counts as proper verification. As a compromise I have updated the table to add a "Verification" column. The idea here is to indicate which results have been independently verified by another contributor. My idea is that that verification should include some sort of write-up (wiki page, blog post, etc) describing the TM and how it is known to run this long. I have linked to examples of my own for Pavel's BB(6) and Daniel's BB(16) champions. I would love to see some independent analyses of other TMs here (especially smaller ones like Racheline's BB(14) > Graham champion). [[User:Sligocki\|Sligocki]] ([[User talk:Sligocki\|talk]]) 16:19, 10 December 2024 (UTC)		This champions page has ended up with a lot of self reported and (I assume) not independently verified champions. I'm conflicted about this: On the one hand I want this wiki to have an encyclopedic/Wikipedia style: it would include things which are known, established and verified. On the other hand, I don't want to stifle innovation or gatekeep what counts as proper verification. As a compromise I have updated the table to add a "Verification" column. The idea here is to indicate which results have been independently verified by another contributor. My idea is that that verification should include some sort of write-up (wiki page, blog post, etc) describing the TM and how it is known to run this long. I have linked to examples of my own for Pavel's BB(6) and Daniel's BB(16) champions. I would love to see some independent analyses of other TMs here (especially smaller ones like Racheline's BB(14) > Graham champion). [[User:Sligocki\|Sligocki]] ([[User talk:Sligocki\|talk]]) 16:19, 10 December 2024 (UTC)
			:Particularly interesting is Racheline's BB(14) > Graham champion. --[[User:Konkhra\|Konkhra]] ([[User talk:Konkhra\|talk]]) 01:53, 12 December 2024 (UTC)

	==Larger champions==		==Larger champions==