Deterministic autopoietic automata

    Research output: Contribution to journalConference articlepeer-review


    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 languageEnglish (US)
    Pages (from-to)49-53
    Number of pages5
    JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
    StatePublished - Nov 15 2009
    Event5th Workshop on Developments in Computational Models, DCM 2009 - Rhodes, Greece
    Duration: Jul 11 2009 → …

    All Science Journal Classification (ASJC) codes

    • Software

    Cite this