Computational universality and efficiency in morphogenetic systems
From MaRDI portal
Publication:2104142
DOI10.1007/978-3-031-13502-6_11OpenAlexW4290017155MaRDI QIDQ2104142
Publication date: 9 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-13502-6_11
universal computationself-assemblymembrane computingmorphogenetic system\textbf{P} versus \textbf{NP}
Cites Work
- Minimization strategies for maximally parallel multiset rewriting systems
- Small universal Turing machines
- On the robust power of morphogenetic systems for time bounded computation
- From P systems to morphogenetic systems: an overview and open problems
- Morphogenetic systems for resource bounded computation and modeling
- Morphogenetic and homeostatic self-assembled systems
- P Systems with Proteins on Membranes and Membrane Division
- Lectures on Polytopes
- The chemical basis of morphogenesis
- Introduction to Distributed Self-Stabilizing Algorithms
- Self-healing Turing-universal computation in morphogenetic systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computational universality and efficiency in morphogenetic systems
