Universality of Enzymatic Numerical P systems
From MaRDI portal
bio-inspired computingenzymatic numerical P systemsmembrane computingnumerical P systemsTuring universality
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- Computing with membranes
- scientific article; zbMATH DE number 572102 (Why is no real title available?)
- Membrane computing. 10th international workshop, WMC 2009, Curtea de Arges, Romania, August 24--27, 2009. Revised selected and invited papers
- On the power of enzymatic numerical P systems
- Using enzymatic numerical P systems for modeling mobile robot controllers
Cited in
(9)- Universality in stochastic enzymatic futile cycle
- Numerical P systems with Boolean condition
- The computational power of enzymatic numerical P systems working in the sequential mode
- Numerical P systems with migrating variables
- Small universal numerical P systems with thresholds for computing functions
- Numerical P systems with production thresholds
- Enzymatic numerical P systems using elementary arithmetic operations
- Universal enzymatic numerical P systems with small number of enzymatic rules
- On the power of enzymatic numerical P systems
This page was built for publication: Universality of Enzymatic Numerical P systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852139)