Bonus Cryptid - Revision history

RobinCodes: Not a stub

2025-10-30T11:13:59Z

Not a stub

← Older revision		Revision as of 11:13, 30 October 2025
Line 1:		Line 1:
	{{machine\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}}{{unsolved\|Does this TM run forever?~~}}{{Stub~~}}		{{machine\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}}{{unsolved\|Does this TM run forever?}}
	'''Bonus Cryptid''' ({{TM\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB\|undecided}}) is a [[BB(2,5)]] pseudo-random walking [[Cryptid]] found by Daniel Yuan in May 2024. It has been simulated out to at least 10^13634 traditional TM steps ([https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568 by Shawn Ligocki]) and 100 million rule steps (see below) without halting.		'''Bonus Cryptid''' ({{TM\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB\|undecided}}) is a [[BB(2,5)]] pseudo-random walking [[Cryptid]] found by Daniel Yuan in May 2024. It has been simulated out to at least 10^13634 traditional TM steps ([https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568 by Shawn Ligocki]) and 100 million rule steps (see below) without halting.

RobinCodes: /* Analysis by Andrew Ducharme */ Formatting change in the last section

2025-10-26T19:35:41Z

Analysis by Andrew Ducharme: Formatting change in the last section

← Older revision		Revision as of 19:35, 26 October 2025
Line 24:		Line 24:

	== Analysis by Andrew Ducharme ==		== Analysis by Andrew Ducharme ==
	https://discord.com/channels/960643023006490684/1259770421046411285/1336973758182981634<nowiki>I found in August that it hits A(3n+2,0) after 113 A rule steps, but never seriously looked into what happened from there. The tape of the actual TM at that point is ginormous, so I looked at cases A(3n+2,0) -> 0<A 2 0^(3n+2) 2 0. From observations of the cases n=[0,1,2,...,10], the tape </nowiki><code>A(3n+2, 0)</code> goes to <code>(16/3 n + 7 , 1) if n = 0 (mod 3), (16/3n + 25/3, 2) if n = 2 (mod 3).</code> God knows what happens if n is congruent to 1. Using these rules, I was able to go from 113 rule steps to........118 before the congruent 1 case was triggered.		https://discord.com/channels/960643023006490684/1259770421046411285/1336973758182981634

			<nowiki>I found in August that it hits A(3n+2,0) after 113 A rule steps, but never seriously looked into what happened from there. The tape of the actual TM at that point is ginormous, so I looked at cases A(3n+2,0) -> 0<A 2 0^(3n+2) 2 0. From observations of the cases n=[0,1,2,...,10], the tape </nowiki><code>A(3n+2, 0)</code> goes to <code>(16/3 n + 7 , 1) if n = 0 (mod 3), (16/3n + 25/3, 2) if n = 2 (mod 3).</code> God knows what happens if n is congruent to 1. Using these rules, I was able to go from 113 rule steps to........118 before the congruent 1 case was triggered.

	In the first two cases, the lone 2 on the right hand side of the tape becomes a lone 4, and then is subsumed into the normal A(a,b) framework. In the last case, the lone 2 becomes a lone 4, then becomes a lone 1, but from there, I don't see a pattern. Sometimes it fixes itself, like when n = 1, but sometimes we enter a whole new phase like with n = 4.		In the first two cases, the lone 2 on the right hand side of the tape becomes a lone 4, and then is subsumed into the normal A(a,b) framework. In the last case, the lone 2 becomes a lone 4, then becomes a lone 1, but from there, I don't see a pattern. Sometimes it fixes itself, like when n = 1, but sometimes we enter a whole new phase like with n = 4.
	[[Category:BB(2,5)]][[Category:Cryptids]]		[[Category:BB(2,5)]][[Category:Cryptids]]

Polygon: Added Category:BB(2,5)

2025-09-27T16:10:33Z

Added Category:BB(2,5)

← Older revision		Revision as of 16:10, 27 September 2025
Line 27:		Line 27:

	In the first two cases, the lone 2 on the right hand side of the tape becomes a lone 4, and then is subsumed into the normal A(a,b) framework. In the last case, the lone 2 becomes a lone 4, then becomes a lone 1, but from there, I don't see a pattern. Sometimes it fixes itself, like when n = 1, but sometimes we enter a whole new phase like with n = 4.		In the first two cases, the lone 2 on the right hand side of the tape becomes a lone 4, and then is subsumed into the normal A(a,b) framework. In the last case, the lone 2 becomes a lone 4, then becomes a lone 1, but from there, I don't see a pattern. Sometimes it fixes itself, like when n = 1, but sometimes we enter a whole new phase like with n = 4.
	[[Category:Cryptids]]		[[Category:BB(2,5)]][[Category:Cryptids]]

Int-y1 at 06:09, 25 August 2025

2025-08-25T06:09:41Z

← Older revision		Revision as of 06:09, 25 August 2025
Line 1:		Line 1:
	{{machine\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}}{{unsolved\|Does this TM run forever?}}{{Stub}}		{{machine\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}}{{unsolved\|Does this TM run forever?}}{{Stub}}
	{{TM\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB\|undecided}} ~~or '''Bonus Cryptid'''~~ is a [[BB(2,5)]] pseudo-random walking [[Cryptid]] found by Daniel Yuan in May 2024. It has been simulated out to at least 10^13634 traditional TM steps ([https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568 by Shawn Ligocki]) and 100 million rule steps (see below) without halting.		'''Bonus Cryptid''' ({{TM\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB\|undecided}}) is a [[BB(2,5)]] pseudo-random walking [[Cryptid]] found by Daniel Yuan in May 2024. It has been simulated out to at least 10^13634 traditional TM steps ([https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568 by Shawn Ligocki]) and 100 million rule steps (see below) without halting.

	See https://www.sligocki.com/2024/05/10/bb-2-5-is-hard.html#a-bonus-cryptid		See https://www.sligocki.com/2024/05/10/bb-2-5-is-hard.html#a-bonus-cryptid

Int-y1: bold name

2025-08-25T06:08:07Z

bold name

← Older revision		Revision as of 06:08, 25 August 2025
Line 1:		Line 1:
	{{machine\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}}{{unsolved\|Does this TM run forever?}}{{Stub}}		{{machine\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}}{{unsolved\|Does this TM run forever?}}{{Stub}}
	{{TM\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB\|undecided}} ~~sometimes called "~~Bonus Cryptid" is a [[BB(2,5)]] pseudo-random walking [[Cryptid]] found by Daniel Yuan in May 2024. It has been simulated out to at least 10^13634 traditional TM steps ([https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568 by Shawn Ligocki]) and 100 million rule steps (see below) without halting.		{{TM\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB\|undecided}} or '''Bonus Cryptid''' is a [[BB(2,5)]] pseudo-random walking [[Cryptid]] found by Daniel Yuan in May 2024. It has been simulated out to at least 10^13634 traditional TM steps ([https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568 by Shawn Ligocki]) and 100 million rule steps (see below) without halting.

	See https://www.sligocki.com/2024/05/10/bb-2-5-is-hard.html#a-bonus-cryptid		See https://www.sligocki.com/2024/05/10/bb-2-5-is-hard.html#a-bonus-cryptid

Sligocki: Sligocki moved page 1RB3RB---3LA1RA 2LA3RA4LB0LB1LB to Bonus Cryptid: Use name

2025-08-24T21:09:09Z

Sligocki moved page 1RB3RB---3LA1RA 2LA3RA4LB0LB1LB to Bonus Cryptid: Use name

← Older revision		Revision as of 21:09, 24 August 2025
(No difference)

Polygon: Used Template:Stub

2025-08-10T22:22:32Z

Used Template:Stub

← Older revision		Revision as of 22:22, 10 August 2025
Line 1:		Line 1:
	{{machine\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}}{{unsolved\|Does this TM run forever?}}		{{machine\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}}{{unsolved\|Does this TM run forever?}}{{Stub}}
	{{TM\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB\|undecided}} sometimes called "Bonus Cryptid" is a [[BB(2,5)]] pseudo-random walking [[Cryptid]] found by Daniel Yuan in May 2024. It has been simulated out to at least 10^13634 traditional TM steps ([https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568 by Shawn Ligocki]) and 100 million rule steps (see below) without halting.		{{TM\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB\|undecided}} sometimes called "Bonus Cryptid" is a [[BB(2,5)]] pseudo-random walking [[Cryptid]] found by Daniel Yuan in May 2024. It has been simulated out to at least 10^13634 traditional TM steps ([https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568 by Shawn Ligocki]) and 100 million rule steps (see below) without halting.

Line 28:		Line 28:
	In the first two cases, the lone 2 on the right hand side of the tape becomes a lone 4, and then is subsumed into the normal A(a,b) framework. In the last case, the lone 2 becomes a lone 4, then becomes a lone 1, but from there, I don't see a pattern. Sometimes it fixes itself, like when n = 1, but sometimes we enter a whole new phase like with n = 4.		In the first two cases, the lone 2 on the right hand side of the tape becomes a lone 4, and then is subsumed into the normal A(a,b) framework. In the last case, the lone 2 becomes a lone 4, then becomes a lone 1, but from there, I don't see a pattern. Sometimes it fixes itself, like when n = 1, but sometimes we enter a whole new phase like with n = 4.
	[[Category:Cryptids]]		[[Category:Cryptids]]
	~~[[Category:Stub]]~~

Polygon: Changed wording

2025-08-05T11:17:58Z

Changed wording

← Older revision		Revision as of 11:17, 5 August 2025
Line 21:		Line 21:
	</pre>Note: This TM enters an "A()" config much earlier: <code>A(3, 1)</code> but then reaches the undefined <code>A(3n+2, 0)</code> rule several times before reaching the start config listed above.		</pre>Note: This TM enters an "A()" config much earlier: <code>A(3, 1)</code> but then reaches the undefined <code>A(3n+2, 0)</code> rule several times before reaching the start config listed above.

	In Feb 2025, Racheline [https://discord.com/channels/960643023006490684/1259770421046411285/1337181169233559633 simulated] it past the unknown rule. According to her simulation, the machine reaches <code>A(1287547464911049659,10)</code> after <code>1894603970741566467769886232237213051</code> steps, and from there, the TM seems to be a cryptid. Andrew simulated it 100 million (rule) steps beyond this intermediate point, finding <code>b=33320662</code>and "a" on the order of 10^12493892. This matches exactly what we would expect to see from a biased random walk biased towards traveling away from the origin with probability two-thirds. Note the halting condition requires b = 0, which we are probviously unlikely to ever reach again, but if the TM did make it back, there is no guarantee the machine halts. It could simply spiral back into either the a = 3n+1 or a = 3n+2 cases and return to its random walk condition again.		In Feb 2025, Racheline [https://discord.com/channels/960643023006490684/1259770421046411285/1337181169233559633 simulated] it past the unknown rule. According to her simulation, the machine reaches <code>A(1287547464911049659,10)</code> after <code>1894603970741566467769886232237213051</code> steps, and from there, the TM seems to be a cryptid. Andrew simulated it 100 million (rule) steps beyond this intermediate point, finding <code>b=33320662</code>and "a" on the order of 10^12493892. This matches exactly what we would expect to see from a biased random walk biased towards traveling away from the origin with probability two-thirds. Note that the halting condition requires b = 0, which we are probviously unlikely to ever reach again, but if the TM did make it back, there is no guarantee that the machine halts. It could simply spiral back into either the a = 3n+1 or a = 3n+2 cases and return to its random walk condition again.

	== Analysis by Andrew Ducharme ==		== Analysis by Andrew Ducharme ==

Int-y1: add unsolved problem

2025-07-09T01:39:51Z

add unsolved problem

← Older revision		Revision as of 01:39, 9 July 2025
Line 1:		Line 1:
	{{machine\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}}		{{machine\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}}{{unsolved\|Does this TM run forever?}}
	{{TM\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB\|undecided}} sometimes called "Bonus Cryptid" is a [[BB(2,5)]] pseudo-random walking [[Cryptid]] found by Daniel Yuan in May 2024. It has been simulated out to at least 10^13634 traditional TM steps ([https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568 by Shawn Ligocki]) and 100 million rule steps (see below) without halting.		{{TM\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB\|undecided}} sometimes called "Bonus Cryptid" is a [[BB(2,5)]] pseudo-random walking [[Cryptid]] found by Daniel Yuan in May 2024. It has been simulated out to at least 10^13634 traditional TM steps ([https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568 by Shawn Ligocki]) and 100 million rule steps (see below) without halting.

ADucharme: added Shawn's simulation

2025-03-25T21:20:59Z

added Shawn's simulation

← Older revision		Revision as of 21:20, 25 March 2025
Line 1:		Line 1:
	{{machine\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}}		{{machine\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}}
	{{TM\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB\|undecided}} sometimes called "Bonus Cryptid" is a [[BB(2,5)]] ~~Pseudo~~-random walking [[Cryptid]] found by Daniel Yuan in May 2024. It has been simulated out to 100 million rule steps.		{{TM\|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB\|undecided}} sometimes called "Bonus Cryptid" is a [[BB(2,5)]] pseudo-random walking [[Cryptid]] found by Daniel Yuan in May 2024. It has been simulated out to at least 10^13634 traditional TM steps ([https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568 by Shawn Ligocki]) and 100 million rule steps (see below) without halting.

	See https://www.sligocki.com/2024/05/10/bb-2-5-is-hard.html#a-bonus-cryptid		See https://www.sligocki.com/2024/05/10/bb-2-5-is-hard.html#a-bonus-cryptid