Cellular automation - Revision history

Caseorganic at 00:08, 17 June 2011

2011-06-17T00:08:10Z

← Older revision		Revision as of 00:08, 17 June 2011
Line 27:		Line 27:
	== References ==		== References ==
	<references />		<references />

	~~[[Category:Book Pages]]~~
	~~[[Category:Marked for Editing]]~~


	__NOTOC__		__NOTOC__

Caseorganic at 19:40, 14 February 2011

2011-02-14T19:40:52Z

← Older revision		Revision as of 19:40, 14 February 2011
Line 20:		Line 20:
	*[[A New Kind of Science]]		*[[A New Kind of Science]]
	*[[Steve Wolfram]]		*[[Steve Wolfram]]

			===External Links===
			*[http://cscs.umich.edu/~crshalizi/notabene/pattern-formation.html Pattern Dormation] by Cosma Shalizi. Created 26 Dec 2010 18:38. University of Michigan.
			*[http://cscs.umich.edu/~crshalizi/notabene/self-organization.html Self-Organization] by Cosma Shalizi. Created 03 Dec 2010 08:00. University of Michigan.

	== References ==		== References ==

Caseorganic at 19:37, 14 February 2011

2011-02-14T19:37:03Z

← Older revision		Revision as of 19:37, 14 February 2011
Line 1:		Line 1:
	===Definition===		===Definition===
	[[Image:cellular-automata.png\|300px\|thumb\|right\|Image of cellular automata Sierpinski Triangle generated by[http://mendicantbug.com Jason Michael Ada]. [http://www.cs.cmu.edu/~jmadams/source/ca.py Source Code (Python)] used to generate this image.]]		[[Image:cellular-automata.png\|300px\|thumb\|right\|Image of cellular automata Sierpinski Triangle generated by[http://mendicantbug.com Jason Michael Ada]. [http://www.cs.cmu.edu/~jmadams/source/ca.py Source Code (Python)] used to generate this image.]]
	"Cellular automata are the simplest models of spatially distributed processes. They consist of an array of cells, each of which is allowed to be in one of a few states. At the same time, each cell looks to its neighbors to see what states they are in. Using this information each cell applies a simple rule to determine what state it should change to. This basic step is repeated over the whole array, again and again".<ref>http://www.exploratorium.edu/complexity/CompLexicon/automaton.html</ref>		"Cellular automata are the simplest models of spatially distributed processes. They consist of an array of cells, each of which is allowed to be in one of a few states. At the same time, each cell looks to its neighbors to see what states they are in. Using this information each cell applies a simple rule to determine what state it should change to. This basic step is repeated over the whole array, again and again".<ref>[http://www.exploratorium.edu/complexity/CompLexicon/automaton.html Cellular Automata (1947-present) from the CompLexicon] © The Exploratorium, 1996.</ref>

	"A one-dimensional cellular automaton consists of two things: a row of "cells" and a set of "rules"...<ref>http://math.hws.edu/xJava/CA/CA.html</ref> "Each of the cells can be in one of several "states". The number of possible states depends on the automaton. Think of the states as colors. In a two-state automaton, each of the cells can be either black or white. Of course, you might just as easily use purple and orange to represent the states, if you thing that's prettier. In a three-state automaton, the states might be black, red, and blue". <ref>http://math.hws.edu/xJava/CA/CA.html</ref>		"A one-dimensional cellular automaton consists of two things: a row of "cells" and a set of "rules"...<ref>[http://math.hws.edu/xJava/CA/CA.html Introdution to One-dimensional Cellular Automata] David J. Eck, Hobart and William Smith College Math Department.</ref> "Each of the cells can be in one of several "states". The number of possible states depends on the automaton. Think of the states as colors. In a two-state automaton, each of the cells can be either black or white. Of course, you might just as easily use purple and orange to represent the states, if you thing that's prettier. In a three-state automaton, the states might be black, red, and blue". <ref>[http://math.hws.edu/xJava/CA/CA.html Introdution to One-dimensional Cellular Automata] David J. Eck, Hobart and William Smith College Math Department.</ref>

	"A CA doesn't just sit there. Over time, the cells can change from state to state. The cellular automaton's rules determine how the states change. It works like this: When the time comes for the cells to change state, each cell looks around and gathers information on its neighbors' states. (Exactly which cells are considered"neighbors" is also something that depends on the paticular CA.) Based on its own state, its neighbors' states, and the rules of the CA, the cell decides what its new state should be. All the cells change state at the same time. You should think of the row of cells as a miniature "world" that runs through a sequence of "years" or "generations." At the end of each year, all the cells simultaneously decide on their state for the next year". <ref>http://math.hws.edu/xJava/CA/CA.html</ref>		"A CA doesn't just sit there. Over time, the cells can change from state to state. The cellular automaton's rules determine how the states change. It works like this: When the time comes for the cells to change state, each cell looks around and gathers information on its neighbors' states. (Exactly which cells are considered"neighbors" is also something that depends on the paticular CA.) Based on its own state, its neighbors' states, and the rules of the CA, the cell decides what its new state should be. All the cells change state at the same time. You should think of the row of cells as a miniature "world" that runs through a sequence of "years" or "generations." At the end of each year, all the cells simultaneously decide on their state for the next year". <ref>[http://math.hws.edu/xJava/CA/CA.html Introdution to One-dimensional Cellular Automata] David J. Eck, Hobart and William Smith College Math Department.</ref>

	{{clear}}		{{clear}}
Line 13:		Line 13:
	The "game became widely known when it was mentioned in an article published by Scientific American in 1970".<ref>[http://www.bitstorm.org/gameoflife/ Bitstorm.org Game of Life]</ref><ref>[http://ddi.cs.uni-potsdam.de/HyFISCH/Produzieren/lis_projekt/proj_gamelife/ConwayScientificAmerican.htm Mathematical Games: The fantastic combinations of John Conway's new solitaire game "life"] by Martin Gardner. Scientific American 223 (October 1970): 120-123.</ref>		The "game became widely known when it was mentioned in an article published by Scientific American in 1970".<ref>[http://www.bitstorm.org/gameoflife/ Bitstorm.org Game of Life]</ref><ref>[http://ddi.cs.uni-potsdam.de/HyFISCH/Produzieren/lis_projekt/proj_gamelife/ConwayScientificAmerican.htm Mathematical Games: The fantastic combinations of John Conway's new solitaire game "life"] by Martin Gardner. Scientific American 223 (October 1970): 120-123.</ref>

	In Conway's [[Game of Life]], "life has only two states, 1 and 0, standing for "living" and "dead", respectively. The transition rule is also simple. You look at all eight cells immediately around you. If less than two of your neighbors are alive, you die. If exactly two of your neighbors are live, you don't change. If exactly three of your neighbors are alive, you will be alive next turn, regardless of your current state. If four or more of your neighbors are alive, you are over-crowded and you die". <ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>		In Conway's [[Game of Life]], "life has only two states, 1 and 0, standing for "living" and "dead", respectively. The transition rule is also simple. You look at all eight cells immediately around you. If less than two of your neighbors are alive, you die. If exactly two of your neighbors are live, you don't change. If exactly three of your neighbors are alive, you will be alive next turn, regardless of your current state. If four or more of your neighbors are alive, you are over-crowded and you die".<ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>

	"It turns out that the number of interesting configurations you can make from these elements is immense: things which blink and oscillate; things which glide across the plane; things which eat the gliders; things which throw off the gliders like waste". <ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>		"It turns out that the number of interesting configurations you can make from these elements is immense: things which blink and oscillate; things which glide across the plane; things which eat the gliders; things which throw off the gliders like waste".<ref>[http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html Cellular Automata by Cosma Shalizi] Created 25 Oct 2010 04:50. University of Michigan.</ref>
	{{clear}}		{{clear}}
	===Related Articles===		===Related Articles===

Caseorganic at 19:31, 14 February 2011

2011-02-14T19:31:02Z

← Older revision		Revision as of 19:31, 14 February 2011
Line 11:		Line 11:
	[[Image:conways-game-of-life.png\|380px\|thumb\|right\|"One iteration in Conway's game of life. Little animals (1) die from loneliness. Little animal (2) dies from overspill population. Little animal (3) survives. Little animals (4) are procreated". <ref>[http://www.leda-tutorial.org/en/official/ch02s02s02.html LEDA Tutorial - 2.2.2. Two-dimensional arrays]</ref>]]		[[Image:conways-game-of-life.png\|380px\|thumb\|right\|"One iteration in Conway's game of life. Little animals (1) die from loneliness. Little animal (2) dies from overspill population. Little animal (3) survives. Little animals (4) are procreated". <ref>[http://www.leda-tutorial.org/en/official/ch02s02s02.html LEDA Tutorial - 2.2.2. Two-dimensional arrays]</ref>]]

	The ~~Game of Life is a~~ game ~~of cellular automation created~~ by ~~British mathematician John Conway~~ in 1970.<ref>Gardner~~, M~~. (October 1970)~~. Scientific American. ISBN 0894540017~~.</ref>		The "game became widely known when it was mentioned in an article published by Scientific American in 1970".<ref>[http://www.bitstorm.org/gameoflife/ Bitstorm.org Game of Life]</ref><ref>[http://ddi.cs.uni-potsdam.de/HyFISCH/Produzieren/lis_projekt/proj_gamelife/ConwayScientificAmerican.htm Mathematical Games: The fantastic combinations of John Conway's new solitaire game "life"] by Martin Gardner. Scientific American 223 (October 1970): 120-123.</ref>

	Life is a "zero-player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves". <ref>http://en.wikipedia.org/wiki/Conway'~~s_Game_of_Life</ref>~~		In Conway's [[Game of Life]], "life has only two states, 1 and 0, standing for "living" and "dead", respectively. The transition rule is also simple. You look at all eight cells immediately around you. If less than two of your neighbors are alive, you die. If exactly two of your neighbors are live, you don't change. If exactly three of your neighbors are alive, you will be alive next turn, regardless of your current state. If four or more of your neighbors are alive, you are over-crowded and you die". <ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>

	~~In the game~~ [[Game of Life]], "life has only two states, 1 and 0, standing for "living" and "dead", respectively. The transition rule is also simple. You look at all eight cells immediately around you. If less than two of your neighbors are alive, you die. If exactly two of your neighbors are live, you don't change. If exactly three of your neighbors are alive, you will be alive next turn, regardless of your current state. If four or more of your neighbors are alive, you are over-crowded and you die".<ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>

	"It turns out that the number of interesting configurations you can make from these elements is immense: things which blink and oscillate; things which glide across the plane; things which eat the gliders; things which throw off the gliders like waste". <ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>		"It turns out that the number of interesting configurations you can make from these elements is immense: things which blink and oscillate; things which glide across the plane; things which eat the gliders; things which throw off the gliders like waste". <ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>

Caseorganic at 19:21, 14 February 2011

2011-02-14T19:21:45Z

← Older revision		Revision as of 19:21, 14 February 2011
Line 10:		Line 10:
	===Conway's Game of Life===		===Conway's Game of Life===
	[[Image:conways-game-of-life.png\|380px\|thumb\|right\|"One iteration in Conway's game of life. Little animals (1) die from loneliness. Little animal (2) dies from overspill population. Little animal (3) survives. Little animals (4) are procreated". <ref>[http://www.leda-tutorial.org/en/official/ch02s02s02.html LEDA Tutorial - 2.2.2. Two-dimensional arrays]</ref>]]		[[Image:conways-game-of-life.png\|380px\|thumb\|right\|"One iteration in Conway's game of life. Little animals (1) die from loneliness. Little animal (2) dies from overspill population. Little animal (3) survives. Little animals (4) are procreated". <ref>[http://www.leda-tutorial.org/en/official/ch02s02s02.html LEDA Tutorial - 2.2.2. Two-dimensional arrays]</ref>]]
	In Conway's [[Game of Life]], "life has only two states, 1 and 0, standing for "living" and "dead", respectively. The transition rule is also simple. You look at all eight cells immediately around you. If less than two of your neighbors are alive, you die. If exactly two of your neighbors are live, you don't change. If exactly three of your neighbors are alive, you will be alive next turn, regardless of your current state. If four or more of your neighbors are alive, you are over-crowded and you die". <ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>
			The Game of Life is a game of cellular automation created by British mathematician John Conway in 1970.<ref>Gardner, M. (October 1970). Scientific American. ISBN 0894540017.</ref>

			Life is a "zero-player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves". <ref>http://en.wikipedia.org/wiki/Conway's_Game_of_Life</ref>

			In the game [[Game of Life]], "life has only two states, 1 and 0, standing for "living" and "dead", respectively. The transition rule is also simple. You look at all eight cells immediately around you. If less than two of your neighbors are alive, you die. If exactly two of your neighbors are live, you don't change. If exactly three of your neighbors are alive, you will be alive next turn, regardless of your current state. If four or more of your neighbors are alive, you are over-crowded and you die".<ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>

	"It turns out that the number of interesting configurations you can make from these elements is immense: things which blink and oscillate; things which glide across the plane; things which eat the gliders; things which throw off the gliders like waste". <ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>		"It turns out that the number of interesting configurations you can make from these elements is immense: things which blink and oscillate; things which glide across the plane; things which eat the gliders; things which throw off the gliders like waste". <ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>

Caseorganic at 19:17, 14 February 2011

2011-02-14T19:17:07Z

← Older revision		Revision as of 19:17, 14 February 2011
Line 2:		Line 2:
	[[Image:cellular-automata.png\|300px\|thumb\|right\|Image of cellular automata Sierpinski Triangle generated by[http://mendicantbug.com Jason Michael Ada]. [http://www.cs.cmu.edu/~jmadams/source/ca.py Source Code (Python)] used to generate this image.]]		[[Image:cellular-automata.png\|300px\|thumb\|right\|Image of cellular automata Sierpinski Triangle generated by[http://mendicantbug.com Jason Michael Ada]. [http://www.cs.cmu.edu/~jmadams/source/ca.py Source Code (Python)] used to generate this image.]]
	"Cellular automata are the simplest models of spatially distributed processes. They consist of an array of cells, each of which is allowed to be in one of a few states. At the same time, each cell looks to its neighbors to see what states they are in. Using this information each cell applies a simple rule to determine what state it should change to. This basic step is repeated over the whole array, again and again".<ref>http://www.exploratorium.edu/complexity/CompLexicon/automaton.html</ref>		"Cellular automata are the simplest models of spatially distributed processes. They consist of an array of cells, each of which is allowed to be in one of a few states. At the same time, each cell looks to its neighbors to see what states they are in. Using this information each cell applies a simple rule to determine what state it should change to. This basic step is repeated over the whole array, again and again".<ref>http://www.exploratorium.edu/complexity/CompLexicon/automaton.html</ref>

			"A one-dimensional cellular automaton consists of two things: a row of "cells" and a set of "rules"...<ref>http://math.hws.edu/xJava/CA/CA.html</ref> "Each of the cells can be in one of several "states". The number of possible states depends on the automaton. Think of the states as colors. In a two-state automaton, each of the cells can be either black or white. Of course, you might just as easily use purple and orange to represent the states, if you thing that's prettier. In a three-state automaton, the states might be black, red, and blue". <ref>http://math.hws.edu/xJava/CA/CA.html</ref>

			"A CA doesn't just sit there. Over time, the cells can change from state to state. The cellular automaton's rules determine how the states change. It works like this: When the time comes for the cells to change state, each cell looks around and gathers information on its neighbors' states. (Exactly which cells are considered"neighbors" is also something that depends on the paticular CA.) Based on its own state, its neighbors' states, and the rules of the CA, the cell decides what its new state should be. All the cells change state at the same time. You should think of the row of cells as a miniature "world" that runs through a sequence of "years" or "generations." At the end of each year, all the cells simultaneously decide on their state for the next year". <ref>http://math.hws.edu/xJava/CA/CA.html</ref>

	{{clear}}		{{clear}}

Caseorganic at 19:06, 14 February 2011

2011-02-14T19:06:43Z

← Older revision		Revision as of 19:06, 14 February 2011
Line 1:		Line 1:
	===Definition===		===Definition===
	[[Image:cellular-automata.png\|300px\|thumb\|right\|Image of cellular automata Sierpinski Triangle generated by[http://mendicantbug.com Jason Michael Ada]. [http://www.cs.cmu.edu/~jmadams/source/ca.py Source Code (Python)] used to generate this image.]]		[[Image:cellular-automata.png\|300px\|thumb\|right\|Image of cellular automata Sierpinski Triangle generated by[http://mendicantbug.com Jason Michael Ada]. [http://www.cs.cmu.edu/~jmadams/source/ca.py Source Code (Python)] used to generate this image.]]
	"Cellular automata are the simplest models of spatially distributed processes. They consist of an array of cells, each of which is allowed to be in one of a few states. At the same time, each cell looks to its neighbors to see what states they are in. Using this information each cell applies a simple rule to determine what state it should change to. This basic step is repeated over the whole array, again and again". <ref>http://www.exploratorium.edu/complexity/CompLexicon/automaton.html</ref>		"Cellular automata are the simplest models of spatially distributed processes. They consist of an array of cells, each of which is allowed to be in one of a few states. At the same time, each cell looks to its neighbors to see what states they are in. Using this information each cell applies a simple rule to determine what state it should change to. This basic step is repeated over the whole array, again and again".<ref>http://www.exploratorium.edu/complexity/CompLexicon/automaton.html</ref>

	{{clear}}		{{clear}}

	===Conway's Game of Life===		===Conway's Game of Life===
			[[Image:conways-game-of-life.png\|380px\|thumb\|right\|"One iteration in Conway's game of life. Little animals (1) die from loneliness. Little animal (2) dies from overspill population. Little animal (3) survives. Little animals (4) are procreated". <ref>[http://www.leda-tutorial.org/en/official/ch02s02s02.html LEDA Tutorial - 2.2.2. Two-dimensional arrays]</ref>]]
	In Conway's [[Game of Life]], "life has only two states, 1 and 0, standing for "living" and "dead", respectively. The transition rule is also simple. You look at all eight cells immediately around you. If less than two of your neighbors are alive, you die. If exactly two of your neighbors are live, you don't change. If exactly three of your neighbors are alive, you will be alive next turn, regardless of your current state. If four or more of your neighbors are alive, you are over-crowded and you die". <ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>		In Conway's [[Game of Life]], "life has only two states, 1 and 0, standing for "living" and "dead", respectively. The transition rule is also simple. You look at all eight cells immediately around you. If less than two of your neighbors are alive, you die. If exactly two of your neighbors are live, you don't change. If exactly three of your neighbors are alive, you will be alive next turn, regardless of your current state. If four or more of your neighbors are alive, you are over-crowded and you die". <ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>

	"It turns out that the number of interesting configurations you can make from these elements is immense: things which blink and oscillate; things which glide across the plane; things which eat the gliders; things which throw off the gliders like waste". <ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>		"It turns out that the number of interesting configurations you can make from these elements is immense: things which blink and oscillate; things which glide across the plane; things which eat the gliders; things which throw off the gliders like waste". <ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>
			{{clear}}
	===Related Articles===		===Related Articles===
	*[[A New Kind of Science]]		*[[A New Kind of Science]]

Caseorganic at 17:39, 14 February 2011

2011-02-14T17:39:26Z

← Older revision		Revision as of 17:39, 14 February 2011
Line 1:		Line 1:
	~~{{stub}}~~		===Definition===
			[[Image:cellular-automata.png\|300px\|thumb\|right\|Image of cellular automata Sierpinski Triangle generated by[http://mendicantbug.com Jason Michael Ada]. [http://www.cs.cmu.edu/~jmadams/source/ca.py Source Code (Python)] used to generate this image.]]
			"Cellular automata are the simplest models of spatially distributed processes. They consist of an array of cells, each of which is allowed to be in one of a few states. At the same time, each cell looks to its neighbors to see what states they are in. Using this information each cell applies a simple rule to determine what state it should change to. This basic step is repeated over the whole array, again and again". <ref>http://www.exploratorium.edu/complexity/CompLexicon/automaton.html</ref>

	===~~Definition~~===		{{clear}}
	[[~~Image~~:cellular-automata.~~jpg\|250px\|right]]~~
			===Conway's Game of Life===
			In Conway's [[Game of Life]], "life has only two states, 1 and 0, standing for "living" and "dead", respectively. The transition rule is also simple. You look at all eight cells immediately around you. If less than two of your neighbors are alive, you die. If exactly two of your neighbors are live, you don't change. If exactly three of your neighbors are alive, you will be alive next turn, regardless of your current state. If four or more of your neighbors are alive, you are over-crowded and you die". <ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>

	~~===Summary===~~		"It turns out that the number of interesting configurations you can make from these elements is immense: things which blink and oscillate; things which glide across the plane; things which eat the gliders; things which throw off the gliders like waste". <ref>http://cscs.umich.edu/~crshalizi/notabene/cellular-automata.html</ref>

	===Related Articles===		===Related Articles===
Line 10:		Line 14:
	*[[Steve Wolfram]]		*[[Steve Wolfram]]

	~~[[Category:Books]]~~		== References ==
			<references />

	[[Category:Book Pages]]		[[Category:Book Pages]]
	[[Category:~~Unfinished~~]]		[[Category:Marked for Editing]]


			__NOTOC__

Caseorganic: Created page with '{{stub}} ===Definition=== right ===Summary=== ===Related Articles=== A New Kind of Science Steve Wolfram Category:Books […'

2011-01-26T04:10:26Z

Created page with '{{stub}} ===Definition=== 250px|right ===Summary=== ===Related Articles=== *A New Kind of Science *Steve Wolfram Category:Books […'

New page

{{stub}}

===Definition===
[[Image:cellular-automata.jpg|250px|right]]

===Summary===

===Related Articles===
*[[A New Kind of Science]]
*[[Steve Wolfram]]

[[Category:Books]]

[[Category:Book Pages]]
[[Category:Unfinished]]