User:Ssstephen/rule-110 - Revision history

Ssstephen at 13:58, 16 November 2022

2022-11-16T13:58:14Z

@@ Line 1: / Line 1: @@
 =Rule 110=
 Play the [https://editor.p5js.org/elfcup/full/actL9pwcX universal game]
-Click anywhere to change a pixel. This is a p5.js version of the cellular automata often referred to as Rule 110. Each cell (black or white square) is generated by simple rules from the three squares above it.
+Click anywhere to change a pixel. This is a p5.js version of the cellular automaton often referred to as Rule 110. Each cell (black or white square) is generated by simple rules from the three squares above it.
@@ Line 31: / Line 35: @@
 {{:User:Ssstephen/Reading/Universality in Elementary Cellular Automata}}
-==Playing this with a deck of cards==
+=Why=
 # Players are given a large number of cards which are black on one side and white on the other. Players should be in a circle.
@@ Line 62: / Line 88: @@
 Then proceed by the usual rules. Programs can be written by making variations on the starting hand.
-===Memoryless version===
+==Memoryless version==
-Each player gets one card and flips it too black or white according to the usual rules. This requires much less cards! An alternative form of memory could be used like time lapse photography.
+Each player gets one card and flips it to black or white according to the usual rules. This requires much less cards! An alternative form of memory could be used like time lapse photography. A digital memoryless version, possibly in a circle, could also show this principle.
-==digital memoryless version==
+Then Daniela suggested laser cutting the cards out of scrap instead of specially bought/created paper. This has the benefit of not being constrained to playing card size (in favour of the found cards), and I decided cutting a few pieces of paper for a prototype would be a worthwhile expenditure of materials / energy. The materials were on their way to being recycled and still can be at some stage so I have just inserted an extra state in that process. The energy from the lasercutter however cannot be recovered, so the cost of the prototype includes this energy. Using visibly recycled materials also has a symbolic strength of course, and could make this action even more worthwhile. The energy expense of the lasercutter "paid for" the symbolic currency of the prototype. Weird commerce metaphor but it is useful when thinking about balance.

Ssstephen at 19:32, 2 November 2022

2022-11-02T19:32:36Z

← Older revision		Revision as of 21:32, 2 November 2022
Line 61:		Line 61:

	Then proceed by the usual rules. Programs can be written by making variations on the starting hand.		Then proceed by the usual rules. Programs can be written by making variations on the starting hand.

			===Memoryless version===
			Each player gets one card and flips it too black or white according to the usual rules. This requires much less cards! An alternative form of memory could be used like time lapse photography.

			==digital memoryless version==
			Possibly in a circle

Ssstephen: /* Playing this with a deck of cards */

2022-11-02T19:27:06Z

Playing this with a deck of cards

← Older revision		Revision as of 21:27, 2 November 2022
Line 34:		Line 34:

	# Players are given a large number of cards which are black on one side and white on the other. Players should be in a circle.		# Players are given a large number of cards which are black on one side and white on the other. Players should be in a circle.
	# In the first hand everyone plays one card with either side face up, chosen by any method (no rules! see below for turing complete version of the game).		# In the first hand everyone plays one card with either side face up, chosen by any method (no rules for this hand! see below for turing complete version of the game).
	# Everyone plays a new card based on the last ~~rounds~~ cards (in particular their own and the player on each side of them).		# Everyone plays a new card based on the last hand's cards (in particular their own and the player on each side of them).
	#*If you and your neighbours all played the same colour last round, you should play white.		#*If you and your neighbours all played the same colour last round, you should play white.
	#*If the person to your left played black but you and the person to your right played white, you should play white.		#*If the person to your left played black but you and the person to your right played white, you should play white.
	#*In all other cases, you should play black.		#*In all other cases, you should play black.
	# Keep playing until you halt!		# Keep playing hands until you halt!

	===Turing complete variation===		===Turing complete variation===

Ssstephen: /* Rule 110 */

2022-11-02T18:42:05Z

Rule 110

← Older revision		Revision as of 20:42, 2 November 2022
Line 1:		Line 1:
	=Rule 110=		=Rule 110=

	[https://editor.p5js.org/elfcup/full/actL9pwcX universal game]		Play the [https://editor.p5js.org/elfcup/full/actL9pwcX universal game]

	Click anywhere to change a pixel. This is a p5.js version of the cellular automata often referred to as Rule 110. Each cell (black or white square) is generated by simple rules from the three squares above it.		Click anywhere to change a pixel. This is a p5.js version of the cellular automata often referred to as Rule 110. Each cell (black or white square) is generated by simple rules from the three squares above it.

Ssstephen: /* Universality in Elementary Cellular Automata, Matthew Cook */

2022-11-02T18:41:45Z

Universality in Elementary Cellular Automata, Matthew Cook

← Older revision		Revision as of 20:41, 2 November 2022
Line 12:		Line 12:

	This game has been proven turing complete by Matthew Cook in [http://www.complex-systems.com/pdf/15-1-1.pdf Universality in Elementary Cellular Automata]. In particular a universal computer can be built when using the repeating background pattern 11101100100000. On this background variations can be make to programme "gliders" in a cyclic tag system, which is itself capable of universal computation.		This game has been proven turing complete by Matthew Cook in [http://www.complex-systems.com/pdf/15-1-1.pdf Universality in Elementary Cellular Automata]. In particular a universal computer can be built when using the repeating background pattern 11101100100000. On this background variations can be make to programme "gliders" in a cyclic tag system, which is itself capable of universal computation.

			-

			-

			-

	-		-
Line 24:		Line 30:

	{{:User:Ssstephen/Reading/Universality in Elementary Cellular Automata}}		{{:User:Ssstephen/Reading/Universality in Elementary Cellular Automata}}


	==Playing this with a deck of cards==		==Playing this with a deck of cards==

Ssstephen: Created page with "=Rule 110= [https://editor.p5js.org/elfcup/full/actL9pwcX universal game] Click anywhere to change a pixel. This is a p5.js version of the cellular automata often referred to as Rule 110. Each cell (black or white square) is generated by simple rules from the three squares above it. ==Universality in Elementary Cellular Automata, Matthew Cook== File:Rule110-bg.png|thumb|right|alt=Background pattern for the cellular automata rule 110, when it is used as a universa..."

2022-11-02T18:41:31Z

Created page with "=Rule 110= [https://editor.p5js.org/elfcup/full/actL9pwcX universal game] Click anywhere to change a pixel. This is a p5.js version of the cellular automata often referred to as Rule 110. Each cell (black or white square) is generated by simple rules from the three squares above it. ==Universality in Elementary Cellular Automata, Matthew Cook== File:Rule110-bg.png|thumb|right|alt=Background pattern for the cellular automata rule 110, when it is used as a universa..."

New page

=Rule 110=

[https://editor.p5js.org/elfcup/full/actL9pwcX universal game]

Click anywhere to change a pixel. This is a p5.js version of the cellular automata often referred to as Rule 110. Each cell (black or white square) is generated by simple rules from the three squares above it.

==Universality in Elementary Cellular Automata, Matthew Cook==

[[File:Rule110-bg.png|thumb|right|alt=Background pattern for the cellular automata rule 110, when it is used as a universal computer.|Background pattern for the cellular automata rule 110, when it is used as a universal computer.]]
[[File:Rule110-gliders.png|thumb|right|alt=A larger section of rule 110 gameplay showing some gliders|A larger section of rule 110 gameplay showing some gliders]]

This game has been proven turing complete by Matthew Cook in [http://www.complex-systems.com/pdf/15-1-1.pdf Universality in Elementary Cellular Automata]. In particular a universal computer can be built when using the repeating background pattern 11101100100000. On this background variations can be make to programme "gliders" in a cyclic tag system, which is itself capable of universal computation.

-

-

-

-

-

{{:User:Ssstephen/Reading/Universality in Elementary Cellular Automata}}

==Playing this with a deck of cards==

# Players are given a large number of cards which are black on one side and white on the other. Players should be in a circle.
# In the first hand everyone plays one card with either side face up, chosen by any method (no rules! see below for turing complete version of the game).
# Everyone plays a new card based on the last rounds cards (in particular their own and the player on each side of them).
#*If you and your neighbours all played the same colour last round, you should play white.
#*If the person to your left played black but you and the person to your right played white, you should play white.
#*In all other cases, you should play black.
# Keep playing until you halt!

===Turing complete variation===

If you would like this round to be Turing complete you will need 14n players. The simplest place to start is to play the first round as follows:

*player one: white
*player two: white
*player three: white
*player four: black
*player five: white
*player six: white
*player seven: black
*player eight: black
*player nine: white
*player ten: black
*player eleven: black
*player twelve: black
*player thirteen: black
*player fourteen: black

Then proceed by the usual rules. Programs can be written by making variations on the starting hand.