Deterministic autopoietic automata

Martin Fürer

doi:10.4204/EPTCS.9.6

Deterministic autopoietic automata

Martin Fürer

Eberly College of Science

Research output: Contribution to journal › Conference article › peer-review

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	https://doi.org/10.4204/EPTCS.9.6
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

Access to Document

10.4204/EPTCS.9.6

Cite this

@article{9707afab5dea4fcaa05737fa25e5766b,

title = "Deterministic autopoietic automata",

abstract = "This paper studies two issues related to the paper on Computing by Self-reproduction: Autopoietic Automata by Ji{\v r}{\'i} 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.",

author = "Martin F{\"u}rer",

note = "Publisher Copyright: {\textcopyright} Martin F{\"u}rer.; 5th Workshop on Developments in Computational Models, DCM 2009 ; Conference date: 11-07-2009",

year = "2009",

month = nov,

day = "15",

doi = "10.4204/EPTCS.9.6",

language = "English (US)",

volume = "9",

pages = "49--53",

journal = "Electronic Proceedings in Theoretical Computer Science, EPTCS",

issn = "2075-2180",

publisher = "Open Publishing Association",

}

TY - JOUR

T1 - Deterministic autopoietic automata

AU - Fürer, Martin

N1 - Publisher Copyright: © Martin Fürer.

PY - 2009/11/15

Y1 - 2009/11/15

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85051023680&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85051023680&partnerID=8YFLogxK

U2 - 10.4204/EPTCS.9.6

DO - 10.4204/EPTCS.9.6

M3 - Conference article

AN - SCOPUS:85051023680

SN - 2075-2180

VL - 9

SP - 49

EP - 53

JO - Electronic Proceedings in Theoretical Computer Science, EPTCS

JF - Electronic Proceedings in Theoretical Computer Science, EPTCS

T2 - 5th Workshop on Developments in Computational Models, DCM 2009

Y2 - 11 July 2009

ER -

Deterministic autopoietic automata

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this