Deterministic Autopoietic Automata
Neural and Evolutionary Computing
2009-11-13 v1 Formal Languages and Automata Theory
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.
Keywords
Cite
@article{arxiv.0911.2324,
title = {Deterministic Autopoietic Automata},
author = {Martin Fürer},
journal= {arXiv preprint arXiv:0911.2324},
year = {2009}
}