GMU:BioArt WS15/Xianzhi Zhang - Revision history

Miga: Miga moved page GMU:BioArt/Xianzhi Zhang to GMU:BioArt WS15/Xianzhi Zhang

2017-10-10T15:55:40Z

Miga moved page GMU:BioArt/Xianzhi Zhang to GMU:BioArt WS15/Xianzhi Zhang

← Older revision	Revision as of 15:55, 10 October 2017
(No difference)

Hossini: /* Reference */

2017-03-12T21:20:53Z

Reference

← Older revision		Revision as of 21:20, 12 March 2017
Line 171:		Line 171:
	Paul Rendell, ''A Universal Turing Machine in Conway’s Game of Life''<br />		Paul Rendell, ''A Universal Turing Machine in Conway’s Game of Life''<br />
	Paul Rendell, ''Turing machine universality of the game of life''<br />		Paul Rendell, ''Turing machine universality of the game of life''<br />
			Xiphias Press, ''The Universal Mind: The Evolution of Machine Intelligence and Human Psychology''<br />
	http://golly.sourceforge.net<br />		http://golly.sourceforge.net<br />
	http://conwaylife.com<br />		http://conwaylife.com<br />
	http://www.binarydigits10.com/articles/conwaysgameoflife<br />		http://www.binarydigits10.com/articles/conwaysgameoflife<br />
	http://rendell-attic.org/gol/utm/<br />		http://rendell-attic.org/gol/utm/<br />
	https://github.com/ormanli/Rule-110		https://github.com/ormanli/Rule-110<br />
	https://en.wikipedia.org/wiki/Rule_110		https://en.wikipedia.org/wiki/Rule_110

Hossini: /* Game of Life and Universal Computation */

2017-03-12T21:05:30Z

Game of Life and Universal Computation

← Older revision		Revision as of 21:05, 12 March 2017
Line 83:		Line 83:
	[[File:Sliding block memory Snapshot.png\|400px\|left\|thumb\|Sliding block memory snapshot (Hickerson, 1990)]] [[File:Sliding block memory Scheme.png\|400px\|left\|thumb\|Sliding block memory schematic (Hickerson, 1990)]]		[[File:Sliding block memory Snapshot.png\|400px\|left\|thumb\|Sliding block memory snapshot (Hickerson, 1990)]] [[File:Sliding block memory Scheme.png\|400px\|left\|thumb\|Sliding block memory schematic (Hickerson, 1990)]]

	<br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br> <br><br><br><br><br><br><br><br> <br><br><br><br><br><br><br><br>		<br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br> <br><br><br><br><br><br><br><br> <br><br><br><br><br><br><br><br><br>

	"A sliding block memory pattern was constructed by Hickerson, 1990. It uses several constructions which generate gliders at intervals of 120 generations. This is based on the period 30 Gosper gun. These guns fire salvoes of gliders at a block. The sliding block memory uses a salvo of two gliders to decrement the counter by moving it diagonally one space closer. Three gliders are used to increment it by pushing it further away. An additional glider is sent across the pattern during the decrement. This is deleted by the decrement operation when the block is decremented to zero."		"A sliding block memory pattern was constructed by Hickerson, 1990. It uses several constructions which generate gliders at intervals of 120 generations. This is based on the period 30 Gosper gun. These guns fire salvoes of gliders at a block. The sliding block memory uses a salvo of two gliders to decrement the counter by moving it diagonally one space closer. Three gliders are used to increment it by pushing it further away. An additional glider is sent across the pattern during the decrement. This is deleted by the decrement operation when the block is decremented to zero."
Line 96:		Line 96:
	[[File:GoL Turing Machine.png\|400px\|left\|thumb\|Diagram of the GoL Turing Machine (Paul Rendell, 2011)]]		[[File:GoL Turing Machine.png\|400px\|left\|thumb\|Diagram of the GoL Turing Machine (Paul Rendell, 2011)]]

	~~<br>~~<br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br> <br>		<br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br>

	"The finite state machine part can clearly be seen as the square pattern in the bottom left of the picture. This has an addressing mechanism on the left (state value) and at the bottom (symbol value) and nine memory cells to hold the data table to describe the action for each combination of the internal state and symbol values." (Paul Rendell, 2011)		"The finite state machine part can clearly be seen as the square pattern in the bottom left of the picture. This has an addressing mechanism on the left (state value) and at the bottom (symbol value) and nine memory cells to hold the data table to describe the action for each combination of the internal state and symbol values." (Paul Rendell, 2011)

Hossini: /* Game of Life and Universal Computation */

2017-03-12T21:04:47Z

Game of Life and Universal Computation

← Older revision		Revision as of 21:04, 12 March 2017
Line 83:		Line 83:
	[[File:Sliding block memory Snapshot.png\|400px\|left\|thumb\|Sliding block memory snapshot (Hickerson, 1990)]] [[File:Sliding block memory Scheme.png\|400px\|left\|thumb\|Sliding block memory schematic (Hickerson, 1990)]]		[[File:Sliding block memory Snapshot.png\|400px\|left\|thumb\|Sliding block memory snapshot (Hickerson, 1990)]] [[File:Sliding block memory Scheme.png\|400px\|left\|thumb\|Sliding block memory schematic (Hickerson, 1990)]]

	~~<br>~~<br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br> <br><br><br><br><br><br><br><br> <br><br><br><br><br><br><br><br><br>		<br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br> <br><br><br><br><br><br><br><br> <br><br><br><br><br><br><br><br>

	"A sliding block memory pattern was constructed by Hickerson, 1990. It uses several constructions which generate gliders at intervals of 120 generations. This is based on the period 30 Gosper gun. These guns fire salvoes of gliders at a block. The sliding block memory uses a salvo of two gliders to decrement the counter by moving it diagonally one space closer. Three gliders are used to increment it by pushing it further away. An additional glider is sent across the pattern during the decrement. This is deleted by the decrement operation when the block is decremented to zero."		"A sliding block memory pattern was constructed by Hickerson, 1990. It uses several constructions which generate gliders at intervals of 120 generations. This is based on the period 30 Gosper gun. These guns fire salvoes of gliders at a block. The sliding block memory uses a salvo of two gliders to decrement the counter by moving it diagonally one space closer. Three gliders are used to increment it by pushing it further away. An additional glider is sent across the pattern during the decrement. This is deleted by the decrement operation when the block is decremented to zero."

Hossini: /* Game of Life and Universal Computation */

2017-03-12T21:03:50Z

Game of Life and Universal Computation

Hossini: /* Golly Ticker */

2017-03-12T20:37:27Z

Golly Ticker

← Older revision		Revision as of 20:37, 12 March 2017
Line 39:		Line 39:
	"Each letter is 9 LWSSs in height, except for the "O" which is 11 LWSSs in height. If you take a close look at the characters, not all LWSSs are in the same phase. Some seem to "point" downwards and the rest upwards." (Nilangshu Bidyanta, 2010)		"Each letter is 9 LWSSs in height, except for the "O" which is 11 LWSSs in height. If you take a close look at the characters, not all LWSSs are in the same phase. Some seem to "point" downwards and the rest upwards." (Nilangshu Bidyanta, 2010)

	~~<br><br>~~<br><br><br><br><br>		<br><br><br><br><br>

	"At the left end, there are structures called "Eaters" or “Fishhook". Just flanked one either side by them are the patterns known as "Kok's Galaxy"." (Nilangshu Bidyanta, 2010)		"At the left end, there are structures called "Eaters" or “Fishhook". Just flanked one either side by them are the patterns known as "Kok's Galaxy"." (Nilangshu Bidyanta, 2010)

Hossini: /* Golly Ticker */

2017-03-12T20:36:00Z

Golly Ticker

Hossini: /* Game of Life */

2017-03-12T20:23:41Z

Game of Life

← Older revision		Revision as of 20:23, 12 March 2017
Line 12:		Line 12:
	*Any dead cell with exactly three live cells in the surrounding 8 cells will come alive (reproduction)		*Any dead cell with exactly three live cells in the surrounding 8 cells will come alive (reproduction)
	(Nilangshu Bidyanta, 2010)		(Nilangshu Bidyanta, 2010)
	<br>		<br><br>
	A very good program for exploring and playing with cellular automata including “Game of Life” is “[http://golly.sourceforge.net Golly]”. Click the link to learn more and download the proper version according to your operating system. Operating it is as simple as using Paint program, and it make things much easier to procure the numerous generations. The default pen tool is used to draw new cells or mark alive cells dead. You can also change the speed at which each generation is computed.		A very good program for exploring and playing with cellular automata including “Game of Life” is “[http://golly.sourceforge.net Golly]”. Click the link to learn more and download the proper version according to your operating system. "Operating it is as simple as using Paint program, and it make things much easier to procure the numerous generations. The default pen tool is used to draw new cells or mark alive cells dead. You can also change the speed at which each generation is computed."(Nilangshu Bidyanta, 2010)

	[[File:Screen_Golly.png\|900px\|left\|thumb\|Screenshot of the Golly interface]]		[[File:Screen_Golly.png\|900px\|left\|thumb\|Screenshot of the Golly interface]]

	After you've been familiar with Golly and tried it with random patterns or the ones found in the left panel, you would have noticed that some of the patterns occur frequently. The patterns which remain still for all subsequent generations are called 'Still Lives'. Examples include the “Block” and the “Beehive”. Some patterns moving across the field at different speeds and directions are called spaceships. The smallest spaceship is known as the “Glider”. The “LWSS” is short for “Light Weight Space Ship”. Other patterns repeat after certain generations while maintaining their positions. These are called oscillators. The “Blinker” and the “Beacon” are the most common oscillator.		After you've been familiar with Golly and tried it with random patterns or the ones found in the left panel, you would have noticed that some of the patterns occur frequently. "The patterns which remain still for all subsequent generations are called 'Still Lives'. Examples include the “Block” and the “Beehive”. Some patterns moving across the field at different speeds and directions are called spaceships. The smallest spaceship is known as the “Glider”. The “LWSS” is short for “Light Weight Space Ship”. Other patterns repeat after certain generations while maintaining their positions. These are called oscillators."(Nilangshu Bidyanta, 2010) The “Blinker” and the “Beacon” are the most common oscillator.

	[[File:Block.png\|100px]] [[File:Beehive.png\|100px]]    [[File:Glider.png\|100px]] [[File:LWSS.png\|100px]]    [[File:Blinker.png\|100px]] [[File:Beacon.png\|100px]]		[[File:Block.png\|100px]] [[File:Beehive.png\|100px]]    [[File:Glider.png\|100px]] [[File:LWSS.png\|100px]]    [[File:Blinker.png\|100px]] [[File:Beacon.png\|100px]]

Hossini at 16:01, 12 March 2017

2017-03-12T16:01:51Z

← Older revision		Revision as of 16:01, 12 March 2017
Line 5:		Line 5:
	Life, along with this “Game of Life”, is simply a mathematical model of a self-replicatable machine. It was named “Game of Life” since the rules of the game are similar to life of an organism although over-simplified.		Life, along with this “Game of Life”, is simply a mathematical model of a self-replicatable machine. It was named “Game of Life” since the rules of the game are similar to life of an organism although over-simplified.

	“Game of Life” is played on a theoretically infinite, 2 dimensional square grid where each cell of the grid can take one of two states: “Alive” or “Dead”. The game requires the player to put in an initial pattern of living and dead cells and a program, following some rules, computes the next generation of the pattern. The standard rules of Life are:		“Game of Life” "is played on a theoretically infinite, 2 dimensional square grid where each cell of the grid can take one of two states: “Alive” or “Dead”. The game requires the player to put in an initial pattern of living and dead cells and a program, following some rules, computes the next generation of the pattern."(Nilangshu Bidyanta, 2010) The standard rules of Life are:

	*Any live cell with less than 2 live cells in the surrounding 8 cells will die (loneliness)		*Any live cell with less than 2 live cells in the surrounding 8 cells will die (loneliness)
Line 11:		Line 11:
	*Any live cell with 2 or 3 live cells in the surrounding 8 cells will continue to live to the next generation		*Any live cell with 2 or 3 live cells in the surrounding 8 cells will continue to live to the next generation
	*Any dead cell with exactly three live cells in the surrounding 8 cells will come alive (reproduction)		*Any dead cell with exactly three live cells in the surrounding 8 cells will come alive (reproduction)
			(Nilangshu Bidyanta, 2010)
	<br>		<br>
	A very good program for exploring and playing with cellular automata including “Game of Life” is “[http://golly.sourceforge.net Golly]”. Click the link to learn more and download the proper version according to your operating system. Operating it is as simple as using Paint program, and it make things much easier to procure the numerous generations. The default pen tool is used to draw new cells or mark alive cells dead. You can also change the speed at which each generation is computed.		A very good program for exploring and playing with cellular automata including “Game of Life” is “[http://golly.sourceforge.net Golly]”. Click the link to learn more and download the proper version according to your operating system. Operating it is as simple as using Paint program, and it make things much easier to procure the numerous generations. The default pen tool is used to draw new cells or mark alive cells dead. You can also change the speed at which each generation is computed.

Hossini: /* Reference */

2016-09-16T15:53:33Z

Reference

← Older revision		Revision as of 15:53, 16 September 2016
Line 167:		Line 167:

	Stephen Wolfram, ''A New Kind of Science''<br />		Stephen Wolfram, ''A New Kind of Science''<br />
			Carl S. McTague, James P. Crutchfield, ''Automated pattern detection: An algorithm for constructing optimally synchronizing multi-regular language filters''<br />
			Paul Rendell, ''A Universal Turing Machine in Conway’s Game of Life''<br />
			Paul Rendell, ''Turing machine universality of the game of life''<br />
	http://golly.sourceforge.net<br />		http://golly.sourceforge.net<br />
	http://conwaylife.com<br />		http://conwaylife.com<br />
Line 172:		Line 175:
	http://rendell-attic.org/gol/utm/<br />		http://rendell-attic.org/gol/utm/<br />
	https://github.com/ormanli/Rule-110		https://github.com/ormanli/Rule-110
			https://en.wikipedia.org/wiki/Rule_110

← Older revision		Revision as of 21:03, 12 March 2017
Line 79:		Line 79:
	===Game of Life and Universal Computation===		===Game of Life and Universal Computation===

	It is possible for gliders to interact with other objects in interesting ways. For example, if two gliders are shot at a block in just the right way, the block will move closer to the source of the gliders. If three gliders are shot in just the right way, the block will move farther away. This "sliding block memory" can be used to simulate a counter.		"It is possible for gliders to interact with other objects in interesting ways. For example, if two gliders are shot at a block in just the right way, the block will move closer to the source of the gliders. If three gliders are shot in just the right way, the block will move farther away. This "sliding block memory" can be used to simulate a counter." (Xiphias Press, 2016)

	[[File:Sliding block memory Snapshot.png\|400px\|left\|thumb\|Sliding block memory snapshot (Hickerson, 1990)]] [[File:Sliding block memory Scheme.png\|400px\|left\|thumb\|Sliding block memory schematic (Hickerson, 1990)]]		[[File:Sliding block memory Snapshot.png\|400px\|left\|thumb\|Sliding block memory snapshot (Hickerson, 1990)]] [[File:Sliding block memory Scheme.png\|400px\|left\|thumb\|Sliding block memory schematic (Hickerson, 1990)]]
Line 89:		Line 89:
	<br><br>		<br><br>

	It is possible to construct logic gates such as AND, OR and NOT using gliders. It is possible to build a pattern that acts like a finite state machine connected to two counters. This has the same computational power as a universal Turing machine, so the Game of Life is theoretically as powerful as any computer with unlimited memory and no time constraints: it is Turing complete.		"It is possible to construct logic gates such as AND, OR and NOT using gliders. It is possible to build a pattern that acts like a finite state machine connected to two counters. This has the same computational power as a universal Turing machine, so the Game of Life is theoretically as powerful as any computer with unlimited memory and no time constraints: it is Turing complete." (Xiphias Press, 2016)

	Paul Rendell has implemented a [http://rendell-attic.org/gol/utm/ Universal Turing Machine] in Conway’s Game of Life in 2010. The upper picture shows the pattern of it. The lower Figure shows the general scheme of this Turing Machine.		Paul Rendell has implemented a [http://rendell-attic.org/gol/utm/ Universal Turing Machine] in Conway’s Game of Life in 2010. The upper picture shows the pattern of it. The lower Figure shows the general scheme of this Turing Machine.
Line 98:		Line 98:
	<br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br> <br>		<br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br> <br>

	"The finite state machine part can clearly be seen as the square pattern in the bottom left of the picture. This has an addressing mechanism on the left (state value) and at the bottom (symbol value) and nine memory cells to hold the data table to describe the action for each combination of the internal state and symbol values.		"The finite state machine part can clearly be seen as the square pattern in the bottom left of the picture. This has an addressing mechanism on the left (state value) and at the bottom (symbol value) and nine memory cells to hold the data table to describe the action for each combination of the internal state and symbol values." (Paul Rendell, 2011)

	The Turing Machines tape is represented by the two stack mechanises seen extending top left and bottom right. Each stack cell can trap 3 gliders using the kickback reaction. This is the reaction that turns a glider through 180 degrees when encountering another at right angles. The traps can be seen as empty rectangles between the denser patterns in the cells. These denser patterns delay the transit of the gliders from one cell to the next so that the destination cell is empty when they arrive. The control signals for the cells travel up the sides of the stack.		"The Turing Machines tape is represented by the two stack mechanises seen extending top left and bottom right. Each stack cell can trap 3 gliders using the kickback reaction. This is the reaction that turns a glider through 180 degrees when encountering another at right angles. The traps can be seen as empty rectangles between the denser patterns in the cells. These denser patterns delay the transit of the gliders from one cell to the next so that the destination cell is empty when they arrive. The control signals for the cells travel up the sides of the stack." (Paul Rendell, 2011)

	Between the two stacks is the logic to perform serial to parallel and parallel to serial conversion and generate the stack control signals so that one stack performs a push operation and the other performs a pop operation.		"Between the two stacks is the logic to perform serial to parallel and parallel to serial conversion and generate the stack control signals so that one stack performs a push operation and the other performs a pop operation." (Paul Rendell, 2011)

	The other item visible is the delay loop for the next state which extends from the centre towards the left top corner underneath the left stack. The next state value is copied from the data read from the finite state machine and sent round this loop to address the finite state machine for the next cycle in conjunction with the symbol popped from one of the stacks." (Paul Rendell, 2011)		"The other item visible is the delay loop for the next state which extends from the centre towards the left top corner underneath the left stack. The next state value is copied from the data read from the finite state machine and sent round this loop to address the finite state machine for the next cycle in conjunction with the symbol popped from one of the stacks." (Paul Rendell, 2011)

	===Rule 110 Cellular Automaton===		===Rule 110 Cellular Automaton===

← Older revision		Revision as of 20:36, 12 March 2017
Line 23:		Line 23:
	===Golly Ticker===		===Golly Ticker===

	The more complex patterns must be constructed from a set of basic patterns. The “Golly Ticker” is also no exception. Let’s see what it does first.		"The more complex patterns must be constructed from a set of basic patterns." (Nilangshu Bidyanta, 2010) The “Golly Ticker” is also no exception. Let’s see what it does first.

	Load it from under the menu 'Patterns/Life/Guns/golly-ticker.rle' in the left panel and play it. You should see the word “Golly” (with a stylized “o”) move across the screen and then disappear at the left. This process continues infinitely, just looks like a stock ticker.		Load it from under the menu 'Patterns/Life/Guns/golly-ticker.rle' in the left panel and play it. "You should see the word “Golly” (with a stylized “o”) move across the screen and then disappear at the left. This process continues infinitely," (Nilangshu Bidyanta, 2010) just looks like a stock ticker.

	[[File:Golly Ticker.png\|900px\|left\|thumb\|Original Golly Ticker]]		[[File:Golly Ticker.png\|900px\|left\|thumb\|Original Golly Ticker]]

	First, let's start with the Life objects that make up the text "Golly". The text is made up of what is known as the “Light Weight Space Ship” or LWSS for short. These Life objects continuously move in one of the four directions — up, down, left or right but never diagonally. Their speed is often expressed as a fraction of “c” or the speed of light. The speed of light taken in the context of Life refers to advancement of one cell per generation and this is the fastest a Life object can move.		"First, let's start with the Life objects that make up the text "Golly". The text is made up of what is known as the “Light Weight Space Ship” or LWSS for short. These Life objects continuously move in one of the four directions — up, down, left or right but never diagonally. Their speed is often expressed as a fraction of “c” or the speed of light. The speed of light taken in the context of Life refers to advancement of one cell per generation and this is the fastest a Life object can move." (Nilangshu Bidyanta, 2010)

	[[File:Letter G.png\|250px\|left\|thumb\|"G" made up of LWSS]] [[File:Eaters.png\|250px\|left\|thumb\|Eaters]] [[File:Kok's Galaxy.png\|250px\|left\|thumb\|Kok's Galaxy]]		[[File:Letter G.png\|250px\|left\|thumb\|"G" made up of LWSS]] [[File:Eaters.png\|250px\|left\|thumb\|Eaters]] [[File:Kok's Galaxy.png\|250px\|left\|thumb\|Kok's Galaxy]]
Line 35:		Line 35:
	<br><br><br><br><br><br><br>		<br><br><br><br><br><br><br>

	The “Glider” (mentioned above) can move only diagonally at c/4 whereas the LWSS can move orthogonally at c/2. We can easily verify this using Golly, running slowly enough to clearly see the movements of each generation.		"The “Glider” (mentioned above) can move only diagonally at c/4 whereas the LWSS can move orthogonally at c/2. We can easily verify this using Golly, running slowly enough to clearly see the movements of each generation." (Nilangshu Bidyanta, 2010)

	Each letter is 9 LWSSs in height, except for the "O" which is 11 LWSSs in height. If you take a close look at the characters, not all LWSSs are in the same phase. Some seem to "point" downwards and the rest upwards.		"Each letter is 9 LWSSs in height, except for the "O" which is 11 LWSSs in height. If you take a close look at the characters, not all LWSSs are in the same phase. Some seem to "point" downwards and the rest upwards." (Nilangshu Bidyanta, 2010)

	<br><br><br><br><br><br><br>		<br><br><br><br><br><br><br>

	At the left end, there are structures called "Eaters" or “Fishhook". Just flanked one either side by them are the patterns known as "Kok's Galaxy".		"At the left end, there are structures called "Eaters" or “Fishhook". Just flanked one either side by them are the patterns known as "Kok's Galaxy"." (Nilangshu Bidyanta, 2010)

	Eaters are “Still Lives” which can eat away many objects without sustaining permanent damage. The job of the eater here is to assimilate the LWSSs coming in from the right. Since we have two distinct phases of LWSSs, the eater must be oriented properly to perform its job, otherwise the LWSSs will permanently destroy the eater.		"Eaters are “Still Lives” which can eat away many objects without sustaining permanent damage. The job of the eater here is to assimilate the LWSSs coming in from the right. Since we have two distinct phases of LWSSs, the eater must be oriented properly to perform its job, otherwise the LWSSs will permanently destroy the eater." (Nilangshu Bidyanta, 2010)

	<br><br><br><br><br><br><br><br><br><br><br>		<br><br><br><br><br><br><br><br><br><br><br>

	Kok's Galaxy belongs to the class of oscillators. Functionally, the generations of Kok's Galaxy flanking the eaters don't serve any purpose since deleting them doesn't affect the ticker at all.		"Kok's Galaxy belongs to the class of oscillators. Functionally, the generations of Kok's Galaxy flanking the eaters don't serve any purpose since deleting them doesn't affect the ticker at all." (Nilangshu Bidyanta, 2010)

	[[File:Memory Loop.jpg]]		[[File:Memory Loop.jpg]]

	The text is generated row by row. It starts by first creating the rows in the middle — the sixth and seventh rows. Rows 1 to 6 are created by the six structures at the right-top which are called “memory loops”. The other five are created by the five memory loops at the right bottom. The memory loops hold a specific pattern made of gliders that keep looping in the structure. At one end, they are duplicated where one glider is fed to the "Converter" and the other back into the memory loop.		The text is generated row by row. "It starts by first creating the rows in the middle — the sixth and seventh rows. Rows 1 to 6 are created by the six structures at the right-top which are called “memory loops”. The other five are created by the five memory loops at the right bottom. The memory loops hold a specific pattern made of gliders that keep looping in the structure. At one end, they are duplicated where one glider is fed to the "Converter" and the other back into the memory loop." (Nilangshu Bidyanta, 2010)

	The gliders loop following the yellow arrows with the help of “Reflectors” placed at either ends. Additionally at the bottom end there is a glider duplicator. It produces a glider that moves parallel to the original. While the duplicated glider is sent back into the loop, the original glider is sent to a “Converter” which converts the glider to a LWSS (moves along the first red arrow). Following conversion, the LWSS takes the path of the second red arrow, to become one pixel of a row. All of the memory loops work in the same way and are slightly displaced in height to produce LWSS in separate rows.		"The gliders loop following the yellow arrows with the help of “Reflectors” placed at either ends. Additionally at the bottom end there is a glider duplicator. It produces a glider that moves parallel to the original. While the duplicated glider is sent back into the loop, the original glider is sent to a “Converter” which converts the glider to a LWSS (moves along the first red arrow). Following conversion, the LWSS takes the path of the second red arrow, to become one pixel of a row. All of the memory loops work in the same way and are slightly displaced in height to produce LWSS in separate rows." (Nilangshu Bidyanta, 2010)

	===Modified Golly Ticker & How To===		===Modified Golly Ticker & How To===