Difference between revisions of "Cellular automation"
Caseorganic (Talk | contribs) (Created page with '{{stub}} ===Definition=== right ===Summary=== ===Related Articles=== *A New Kind of Science *Steve Wolfram Category:Books […') |
Caseorganic (Talk | contribs) |
||
| Line 1: | Line 1: | ||
| − | |||
| − | |||
===Definition=== | ===Definition=== | ||
| − | [[Image:cellular-automata. | + | [[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> | ||
| − | === | + | {{clear}} |
| + | |||
| + | ===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> | ||
| + | |||
| + | "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]] | ||
| − | + | == References == | |
| + | <references /> | ||
[[Category:Book Pages]] | [[Category:Book Pages]] | ||
| − | [[Category: | + | [[Category:Marked for Editing]] |
| + | |||
| + | |||
| + | __NOTOC__ | ||
Revision as of 13:39, 14 February 2011
Definition
"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". [1]
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". [2]
"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". [3]
