Complexity Properties of the Cellular Automaton Game of Life
The Game of life is probably the most famous cellular automaton. Life shows all the characteristics of Wolfram's complex Class N cellular automata: long-lived transients, static and propagating local structures, and the ability to support universal computation. We examine in this thesis questio...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
PDXScholar
1995
|
| Subjects: | |
| Online Access: | https://pdxscholar.library.pdx.edu/open_access_etds/4928 https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=6000&context=open_access_etds |