Deterministic Autopoietic Automata

Martin Fürer

This paper studies two issues related to the paper on Computing by Self-reproduction: Autopoietic Automata by Jiri Wiedermann. 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.

In S. Barry Cooper and Vincent Danos: Proceedings Fifth Workshop on Developments in Computational Models — Computational Models From Nature (DCM 2009), Rhodes, Greece, 11th July 2009, Electronic Proceedings in Theoretical Computer Science 9, pp. 49–53.
Published: 15th November 2009.

ArXived at: http://dx.doi.org/10.4204/EPTCS.9.6 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org