Deterministic autopoietic automata

MaRDI QIDQ5146652zbMATH OpenFDO

Authors Martin Fürer

Publication date 26 January 2021

Full work available at URL http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCM2009.6

Mathematics Subject Classification ID

Classical models of computation (Turing machines, etc.) (68Q04) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Formal languages and automata (68Q45)

Recommendations

• Unconventional Computation
• Autopoietic automata: complexity issues in offspring-producing evolving processes
• On determinism versus nondeterminism in P systems
• scientific article; zbMATH DE number 3898244
• Membrane Computing

Cited in

(2)

• Autonomic life as the proof of incompleteness and Lawvere's theorem of fixed point
• Autopoietic automata: complexity issues in offspring-producing evolving processes

This page was built for publication: Deterministic autopoietic automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146652)