Cellular Automata

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5853

Full metadata record

DC Field	Value	Language
dc.creator	Banks, Edwin Roger	-
dc.date	2004-10-01T20:49:39Z	-
dc.date	2004-10-01T20:49:39Z	-
dc.date	1970-06-01	-
dc.date.accessioned	2013-10-09T02:41:36Z	-
dc.date.available	2013-10-09T02:41:36Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-198	-
dc.identifier	http://hdl.handle.net/1721.1/5853	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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.	-
dc.format	76 p.	-
dc.format	28170055 bytes	-
dc.format	1272568 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-198	-
dc.title	Cellular Automata	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI