Deterministic Autopoietic Automata
classification
💻 cs.NE
cs.FL
keywords
automataautopoieticdeterministiccomputationscomputingextendgenerateissues
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.