Abstract
This paper studies two issues related to the paper on Computing by Self-reproduction: Autopoietic Automata by Jiří 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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 49-53 |
| Number of pages | 5 |
| Journal | Electronic Proceedings in Theoretical Computer Science, EPTCS |
| Volume | 9 |
| DOIs | |
| State | Published - Nov 15 2009 |
| Event | 5th Workshop on Developments in Computational Models, DCM 2009 - Rhodes, Greece Duration: Jul 11 2009 → … |
All Science Journal Classification (ASJC) codes
- Software