Wily Coyote - Revision history

Polygon: Added template:unsolved problem

2026-02-28T11:44:54Z

Added template:unsolved problem

← Older revision		Revision as of 11:44, 28 February 2026
Line 1:		Line 1:
	{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}		{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}{{Unsolved\|Does Wily Coyote halt or run forever?}}
	[[File:Wily Coyote Roadrunner Naming.png\|thumb\|Diagram showing the inspiration for the name of Wily Coyote. The Wily Coyote section (C on left) is "chasing" the Roadrunner section (R on right). The machine only has a chance to halt if the Coyote can catch up to the end of the tape.]]		[[File:Wily Coyote Roadrunner Naming.png\|thumb\|Diagram showing the inspiration for the name of Wily Coyote. The Wily Coyote section (C on left) is "chasing" the Roadrunner section (R on right). The machine only has a chance to halt if the Coyote can catch up to the end of the tape.]]
	{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}, called '''Wily Coyote''', is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].		{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}, called '''Wily Coyote''', is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].

LegionMammal978: explanation

2025-10-01T22:38:31Z

explanation

← Older revision		Revision as of 22:38, 1 October 2025
Line 1:		Line 1:
	{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}		{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}
	[[File:Wily Coyote Roadrunner Naming.png\|thumb\|Diagram showing the inspiration for the name of Wily Coyote. The Wily Coyote section (C on left) is "chasing" the Roadrunner section (R on right).]]		[[File:Wily Coyote Roadrunner Naming.png\|thumb\|Diagram showing the inspiration for the name of Wily Coyote. The Wily Coyote section (C on left) is "chasing" the Roadrunner section (R on right). The machine only has a chance to halt if the Coyote can catch up to the end of the tape.]]
	{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}, called '''Wily Coyote''', is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].		{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}, called '''Wily Coyote''', is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].

Sligocki: Add annotated image.

2025-10-01T18:43:46Z

Add annotated image.

← Older revision		Revision as of 18:43, 1 October 2025
Line 1:		Line 1:
	{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}		{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}
			[[File:Wily Coyote Roadrunner Naming.png\|thumb\|Diagram showing the inspiration for the name of Wily Coyote. The Wily Coyote section (C on left) is "chasing" the Roadrunner section (R on right).]]
	{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}, called '''Wily Coyote''', is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].		{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}, called '''Wily Coyote''', is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].

Polygon: Added Category:BB(3,3)

2025-09-27T16:21:17Z

Added Category:BB(3,3)

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

	This is Legion's "pet machine".		This is Legion's "pet machine".
			[[Category:BB(3,3)]]

Int-y1: bold name

2025-08-25T08:50:10Z

bold name

← Older revision		Revision as of 08:50, 25 August 2025
Line 1:		Line 1:
	{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}		{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}
	{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}} is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01]~~. It is also known as "Wily Coyote"~~.		{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}, called '''Wily Coyote''', is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].

	@Legion wrote a simulator in Rust for this TM that can be found [https://discord.com/channels/960643023006490684/1026577255754903572/1244841134761578630 here.] They described the behavior of this machine as <blockquote>"The left side is just bouncing around a <code>1212</code>... pattern, nothing interesting there. But the right side has this extremely peculiar 'binary counter'. Since the head never moves more than a fixed number of cells (3, but effectively only 1) from right to left before finally resetting, we know that all information must flow from left to right. Therefore, it acts somewhat like a binary counter, in the sense that each cell must follow an eventually-periodic pattern as long as the machine doesn't halt, and that period is a non-decreasing power of 2. But as we look further to the right, the pattern actually gets more and more complex, as opposed to the trivial back-and-forth flipping of a real binary counter. The attached program calculates the pattern for each cell, as a function of the previous cell's pattern; by cell 99, the pattern is 11531 lines long. My current hope is in how repetitive the pattern appears; it often has just <code>BBBB</code>..., <code>CCCC</code>..., or <code>ADAD</code>... for hundreds of lines straight. So it might be bounded in how much information it actually contains, which would open a pathway for proving it non-halting."</blockquote>@Racheline wrote an accelerated simulator of this TM in Python:<syntaxhighlight lang="python" line="1">		@Legion wrote a simulator in Rust for this TM that can be found [https://discord.com/channels/960643023006490684/1026577255754903572/1244841134761578630 here.] They described the behavior of this machine as <blockquote>"The left side is just bouncing around a <code>1212</code>... pattern, nothing interesting there. But the right side has this extremely peculiar 'binary counter'. Since the head never moves more than a fixed number of cells (3, but effectively only 1) from right to left before finally resetting, we know that all information must flow from left to right. Therefore, it acts somewhat like a binary counter, in the sense that each cell must follow an eventually-periodic pattern as long as the machine doesn't halt, and that period is a non-decreasing power of 2. But as we look further to the right, the pattern actually gets more and more complex, as opposed to the trivial back-and-forth flipping of a real binary counter. The attached program calculates the pattern for each cell, as a function of the previous cell's pattern; by cell 99, the pattern is 11531 lines long. My current hope is in how repetitive the pattern appears; it often has just <code>BBBB</code>..., <code>CCCC</code>..., or <code>ADAD</code>... for hundreds of lines straight. So it might be bounded in how much information it actually contains, which would open a pathway for proving it non-halting."</blockquote>@Racheline wrote an accelerated simulator of this TM in Python:<syntaxhighlight lang="python" line="1">

Sligocki: Sligocki moved page 1RB2LA1LA 2LA0RA2RC ---0LC2RA to Wily Coyote: Move to common name

2025-08-24T18:11:54Z

Sligocki moved page 1RB2LA1LA 2LA0RA2RC ---0LC2RA to Wily Coyote: Move to common name

← Older revision		Revision as of 18:11, 24 August 2025
(No difference)

Polygon: Combined introduction with link to bbch

2025-08-10T21:11:46Z

Combined introduction with link to bbch

← Older revision		Revision as of 21:11, 10 August 2025
Line 1:		Line 1:
	{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}		{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}
	{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}		{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}} is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01]. It is also known as "Wily Coyote".

	~~Also known as "Wily Coyote".~~
	~~This~~ is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].

	@Legion wrote a simulator in Rust for this TM that can be found [https://discord.com/channels/960643023006490684/1026577255754903572/1244841134761578630 here.] They described the behavior of this machine as <blockquote>"The left side is just bouncing around a <code>1212</code>... pattern, nothing interesting there. But the right side has this extremely peculiar 'binary counter'. Since the head never moves more than a fixed number of cells (3, but effectively only 1) from right to left before finally resetting, we know that all information must flow from left to right. Therefore, it acts somewhat like a binary counter, in the sense that each cell must follow an eventually-periodic pattern as long as the machine doesn't halt, and that period is a non-decreasing power of 2. But as we look further to the right, the pattern actually gets more and more complex, as opposed to the trivial back-and-forth flipping of a real binary counter. The attached program calculates the pattern for each cell, as a function of the previous cell's pattern; by cell 99, the pattern is 11531 lines long. My current hope is in how repetitive the pattern appears; it often has just <code>BBBB</code>..., <code>CCCC</code>..., or <code>ADAD</code>... for hundreds of lines straight. So it might be bounded in how much information it actually contains, which would open a pathway for proving it non-halting."</blockquote>@Racheline wrote an accelerated simulator of this TM in Python:<syntaxhighlight lang="python" line="1">		@Legion wrote a simulator in Rust for this TM that can be found [https://discord.com/channels/960643023006490684/1026577255754903572/1244841134761578630 here.] They described the behavior of this machine as <blockquote>"The left side is just bouncing around a <code>1212</code>... pattern, nothing interesting there. But the right side has this extremely peculiar 'binary counter'. Since the head never moves more than a fixed number of cells (3, but effectively only 1) from right to left before finally resetting, we know that all information must flow from left to right. Therefore, it acts somewhat like a binary counter, in the sense that each cell must follow an eventually-periodic pattern as long as the machine doesn't halt, and that period is a non-decreasing power of 2. But as we look further to the right, the pattern actually gets more and more complex, as opposed to the trivial back-and-forth flipping of a real binary counter. The attached program calculates the pattern for each cell, as a function of the previous cell's pattern; by cell 99, the pattern is 11531 lines long. My current hope is in how repetitive the pattern appears; it often has just <code>BBBB</code>..., <code>CCCC</code>..., or <code>ADAD</code>... for hundreds of lines straight. So it might be bounded in how much information it actually contains, which would open a pathway for proving it non-halting."</blockquote>@Racheline wrote an accelerated simulator of this TM in Python:<syntaxhighlight lang="python" line="1">

Polygon: Moved points outside of quotations

2025-08-05T13:42:08Z

Moved points outside of quotations

← Older revision		Revision as of 13:42, 5 August 2025
Line 2:		Line 2:
	{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}		{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}

	Also known as "Wily Coyote."		Also known as "Wily Coyote".
	This is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].		This is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].

Line 56:		Line 56:


	This is Legion's "pet machine."		This is Legion's "pet machine".

Peacemaker II at 20:11, 15 June 2025

2025-06-15T20:11:08Z

← Older revision		Revision as of 20:11, 15 June 2025
Line 3:		Line 3:

	Also known as "Wily Coyote."		Also known as "Wily Coyote."
	This is BB(3,3) holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].		This is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].

	@Legion wrote a simulator in Rust for this TM that can be found [https://discord.com/channels/960643023006490684/1026577255754903572/1244841134761578630 here.] They described the behavior of this machine as <blockquote>"The left side is just bouncing around a <code>1212</code>... pattern, nothing interesting there. But the right side has this extremely peculiar 'binary counter'. Since the head never moves more than a fixed number of cells (3, but effectively only 1) from right to left before finally resetting, we know that all information must flow from left to right. Therefore, it acts somewhat like a binary counter, in the sense that each cell must follow an eventually-periodic pattern as long as the machine doesn't halt, and that period is a non-decreasing power of 2. But as we look further to the right, the pattern actually gets more and more complex, as opposed to the trivial back-and-forth flipping of a real binary counter. The attached program calculates the pattern for each cell, as a function of the previous cell's pattern; by cell 99, the pattern is 11531 lines long. My current hope is in how repetitive the pattern appears; it often has just <code>BBBB</code>..., <code>CCCC</code>..., or <code>ADAD</code>... for hundreds of lines straight. So it might be bounded in how much information it actually contains, which would open a pathway for proving it non-halting."</blockquote>@Racheline wrote an accelerated simulator of this TM in Python:<syntaxhighlight lang="python" line="1">		@Legion wrote a simulator in Rust for this TM that can be found [https://discord.com/channels/960643023006490684/1026577255754903572/1244841134761578630 here.] They described the behavior of this machine as <blockquote>"The left side is just bouncing around a <code>1212</code>... pattern, nothing interesting there. But the right side has this extremely peculiar 'binary counter'. Since the head never moves more than a fixed number of cells (3, but effectively only 1) from right to left before finally resetting, we know that all information must flow from left to right. Therefore, it acts somewhat like a binary counter, in the sense that each cell must follow an eventually-periodic pattern as long as the machine doesn't halt, and that period is a non-decreasing power of 2. But as we look further to the right, the pattern actually gets more and more complex, as opposed to the trivial back-and-forth flipping of a real binary counter. The attached program calculates the pattern for each cell, as a function of the previous cell's pattern; by cell 99, the pattern is 11531 lines long. My current hope is in how repetitive the pattern appears; it often has just <code>BBBB</code>..., <code>CCCC</code>..., or <code>ADAD</code>... for hundreds of lines straight. So it might be bounded in how much information it actually contains, which would open a pathway for proving it non-halting."</blockquote>@Racheline wrote an accelerated simulator of this TM in Python:<syntaxhighlight lang="python" line="1">

Sligocki at 17:12, 14 January 2025

2025-01-14T17:12:28Z

← Older revision		Revision as of 17:12, 14 January 2025
Line 1:		Line 1:
			{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}
	{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}		{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}

Line 56:		Line 57:

	This is Legion's "pet machine."		This is Legion's "pet machine."


	~~[[Category:Individual machines]]~~

← Older revision		Revision as of 11:44, 28 February 2026
Line 1:		Line 1:
	{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}		{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}{{Unsolved\|Does Wily Coyote halt or run forever?}}
	[[File:Wily Coyote Roadrunner Naming.png\|thumb\|Diagram showing the inspiration for the name of Wily Coyote. The Wily Coyote section (C on left) is "chasing" the Roadrunner section (R on right). The machine only has a chance to halt if the Coyote can catch up to the end of the tape.]]		[[File:Wily Coyote Roadrunner Naming.png\|thumb\|Diagram showing the inspiration for the name of Wily Coyote. The Wily Coyote section (C on left) is "chasing" the Roadrunner section (R on right). The machine only has a chance to halt if the Coyote can catch up to the end of the tape.]]
	{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}, called '''Wily Coyote''', is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].		{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}, called '''Wily Coyote''', is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].

← Older revision		Revision as of 22:38, 1 October 2025
Line 1:		Line 1:
	{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}		{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}
	[[File:Wily Coyote Roadrunner Naming.png\|thumb\|Diagram showing the inspiration for the name of Wily Coyote. The Wily Coyote section (C on left) is "chasing" the Roadrunner section (R on right).]]		[[File:Wily Coyote Roadrunner Naming.png\|thumb\|Diagram showing the inspiration for the name of Wily Coyote. The Wily Coyote section (C on left) is "chasing" the Roadrunner section (R on right). The machine only has a chance to halt if the Coyote can catch up to the end of the tape.]]
	{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}, called '''Wily Coyote''', is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].		{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}, called '''Wily Coyote''', is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].

← Older revision		Revision as of 18:43, 1 October 2025
Line 1:		Line 1:
	{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}		{{machine\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}
			[[File:Wily Coyote Roadrunner Naming.png\|thumb\|Diagram showing the inspiration for the name of Wily Coyote. The Wily Coyote section (C on left) is "chasing" the Roadrunner section (R on right).]]
	{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}, called '''Wily Coyote''', is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].		{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}, called '''Wily Coyote''', is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM\|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].