Title of article
Deterministic Autopoietic Automata
Author/Authors
Martin Furer، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
49
To page
53
Abstract
This paper studies two issues related to the paper on Computing by Self-reproduction: Autopoietic Automata by Jiii Wiedemann. It is shown that all results presented there extend to deterministic computations. In particular, nondeterminism is not needed for a lineage to generate all autopoietic automata.
Journal title
Electronic Proceedings in Theoretical Computer Science
Serial Year
2009
Journal title
Electronic Proceedings in Theoretical Computer Science
Record number
679751
Link To Document