Deterministic Autopoietic Automata
arXiv:0911.2324 · doi:10.4204/EPTCS.9.6
Abstract
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.