82,891
edits
Conway’s Game of Life: Difference between revisions
no edit summary
Amwelladmin (talk | contribs) No edit summary |
Amwelladmin (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
{{a|systems|{{image|conway|gif|Conway’s Game of Life, yesterday.}}}} | {{a|systems|{{image|conway|gif|Conway’s Game of Life, yesterday.}}}} | ||
The “Game of Life” is a cellular automaton — not really a game in a meaningful sense, since it plays by itself — invented by mathematician John Conway in 1970. | The “Game of Life” is a [[cellular automaton]] — not really a game in a meaningful sense, since it plays by itself — invented by mathematician John Conway in 1970. | ||
It is a simple [https://en.wikipedia.org/wiki/Turing_machine Turing Machine]. It comprises an unbounded, two-dimensional grid of cells, each of which may be “live” (''black'') or “dead” (''white''). At each generation every cell interacts with its eight adjacent “neighbour” cells, as follows: | It is a simple [https://en.wikipedia.org/wiki/Turing_machine Turing Machine]. It comprises an unbounded, two-dimensional grid of cells, each of which may be “live” (''black'') or “dead” (''white''). At each generation every cell interacts with its eight adjacent “neighbour” cells, as follows: | ||
| Line 20: | Line 20: | ||
===Reductio ad absurdum=== | ===Reductio ad absurdum=== | ||
{{conway and complexity}} | {{conway and complexity}} | ||
{{sa}} | |||
*[[Determinism]] | |||