Deterministic Autopoietic Automata
Martin F\"urer
TL;DR
This paper extends previous work on autopoietic automata to deterministic models, showing that nondeterminism is unnecessary for generating all autopoietic automata, thus simplifying the theoretical framework.
Contribution
It demonstrates that all results on autopoietic automata from prior nondeterministic models also hold in deterministic settings, removing the need for nondeterminism.
Findings
Deterministic autopoietic automata can generate all autopoietic automata.
Nondeterminism is not required for the lineage to produce all autopoietic automata.
Results from previous nondeterministic models extend to deterministic models.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · DNA and Biological Computing · Computability, Logic, AI Algorithms