Morphogenetic computing: computability and complexity results

DOI10.1007/s11047-022-09899-xzbMath1530.68106OpenAlexW4285730935MaRDI QIDQ6177192

Petr Sosík

Publication date: 31 August 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-022-09899-x

zbMATH Keywords

universal computationself-assemblymembrane computingP versus NPmorphogenetic system

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimization strategies for maximally parallel multiset rewriting systems
• Small universal Turing machines
• On the robust power of morphogenetic systems for time bounded computation
• Computationally universal P systems without priorities: Two catalysts are sufficient
• 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
• Universality of Wolfram’s 2, 3 Turing Machine
• Self-healing Turing-universal computation in morphogenetic systems

This page was built for publication: Morphogenetic computing: computability and complexity results