Statements (32)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
cellular automaton
|
| gptkbp:alsoKnownAs |
gptkb:Conway's_Game_of_Life
|
| gptkbp:creator |
gptkb:John_Horton_Conway
|
| gptkbp:field |
gptkb:mathematics
computer science |
| gptkbp:firstPublished |
1970
|
| gptkbp:hasCellState |
alive
dead |
| gptkbp:hasGridType |
infinite two-dimensional orthogonal grid
|
| gptkbp:hasRule |
cellular automaton
Any live cell with two or three live neighbours survives. zero-player game Any dead cell with three live neighbours becomes a live cell. All other live cells die in the next generation. Similarly, all other dead cells stay dead. |
| gptkbp:hasUpdateType |
discrete time steps
|
| gptkbp:hasWebsite |
https://conwaylife.com/
|
| https://www.w3.org/2000/01/rdf-schema#label |
Lifegame
|
| gptkbp:inspiredBy |
computer simulations
algorithmic art artificial life research complex systems studies |
| gptkbp:neighborhood |
gptkb:Moore_neighborhood
|
| gptkbp:pattern |
gptkb:aircraft
gptkb:brick gptkb:satellite turtle pulsar beacon blinker |
| gptkbp:publishedIn |
gptkb:Scientific_American
|
| gptkbp:bfsParent |
gptkb:Improbable_theatre_company
|
| gptkbp:bfsLayer |
7
|