Cellular Automata
| dc.date.accessioned | 2004-10-01T20:49:39Z | |
| dc.date.accessioned | 2018-11-24T10:10:51Z | |
| dc.date.available | 2004-10-01T20:49:39Z | |
| dc.date.available | 2018-11-24T10:10:51Z | |
| dc.date.issued | 1970-06-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/5853 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/5853 | |
| dc.description.abstract | This paper presents in order 1) a brief description of the results, 2) a definition of cellular automata, 3) discussion of previous work in this area by Von Neumann and Codd, and 4) details of how the prescribed behaviors are achieved (with computer simulations included in the appendices). The results include showing that a two state cell with five neighbors is sufficient for universality. | en_US |
| dc.format.extent | 76 p. | en_US |
| dc.format.extent | 28170055 bytes | |
| dc.format.extent | 1272568 bytes | |
| dc.language.iso | en_US | |
| dc.title | Cellular Automata | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-198.pdf | 1.272Mb | application/pdf | View/ |
| AIM-198.ps | 28.17Mb | application/postscript | View/ |