Conference ProceedingsOPEN ACCESS

Deterministic autopoietic automata

Electronic Proceedings in Theoretical Computer Science, EPTCS (2009) 9 49-53
DOI: 10.4204/EPTCS.9.6
0Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Fürer, M. (2009). Deterministic autopoietic automata. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 9, pp. 49–53). Open Publishing Association. https://doi.org/10.4204/EPTCS.9.6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free