A Simple Algorithm for Self-Replication

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

Full metadata record

DC Field	Value	Language
dc.creator	Winograd, Terry	-
dc.date	2004-10-01T20:47:24Z	-
dc.date	2004-10-01T20:47:24Z	-
dc.date	1970-05-01	-
dc.date.accessioned	2013-10-09T02:41:29Z	-
dc.date.available	2013-10-09T02:41:29Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-197	-
dc.identifier	http://hdl.handle.net/1721.1/5843	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	A recurrent topic of interest in the theory of automata has been the possibility of self-reproducing automata, particularly those which could reproduce globally through an application of a algorithm. In such a device, the "growth" at any point would depend at any time only on the local environment, but overall effect would be the reproduction of complex structures. This paper gives an algorithm of this type (an extension of an algorithm brought to my attention by Professor Fredkin) and examines the conditions under which such replication will occur. The system on which it operates will be defined, and the main theorem on its operation will follow several lemmas.	-
dc.format	13 p.	-
dc.format	4875534 bytes	-
dc.format	282067 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-197	-
dc.title	A Simple Algorithm for Self-Replication	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI