Year: 2009
Type: article
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.
DOI: 10.4204/eptcs.9.6
Author: Martin Fürer
Institutions: Pennsylvania State University, University of Zurich
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Funder: National Science Foundation
OpenAlex ID: W2087397272
FWCI:
Cites:
Cited by:
Related to: