Morphogenetic computing: computability and complexity results
From MaRDI portal
Recommendations
- Morphogenetic systems for resource bounded computation and modeling
- From P systems to morphogenetic systems: an overview and open problems
- On the robust power of morphogenetic systems for time bounded computation
- Self-healing Turing-universal computation in morphogenetic systems
- Morphogenetic and homeostatic self-assembled systems
Cites work
- Computationally universal P systems without priorities: Two catalysts are sufficient
- From P systems to morphogenetic systems: an overview and open problems
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 1142308 (Why is no real title available?)
- Lectures on Polytopes
- Minimization strategies for maximally parallel multiset rewriting systems
- Morphogenetic and homeostatic self-assembled systems
- Morphogenetic systems for resource bounded computation and modeling
- On the robust power of morphogenetic systems for time bounded computation
- P systems with proteins on membranes
- P Systems with Proteins on Membranes and Membrane Division
- Self-healing Turing-universal computation in morphogenetic systems
- Small universal Turing machines
- The chemical basis of morphogenesis
- Universality of Wolfram’s 2, 3 Turing Machine
Cited in
(3)
This page was built for publication: Morphogenetic computing: computability and complexity results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6177192)
