Universality of Enzymatic Numerical P systems

DOI10.1080/00207160.2012.748897zbMath1286.68146OpenAlexW2018202205MaRDI QIDQ2852139

Cristian Ioan Vasile, Ana Brânduşa Pavel, Ioan Dumitrache

Publication date: 8 October 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.748897

zbMATH Keywords

membrane computingTuring universalitybio-inspired computingnumerical P systemsenzymatic numerical P systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Numerical P systems with migrating variables ⋮ The computational power of enzymatic numerical P systems working in the sequential mode ⋮ Numerical P systems with production thresholds ⋮ Numerical P systems with Boolean condition ⋮ Small Universal Numerical P Systems with Thresholds for Computing Functions

Cites Work

• On the power of enzymatic numerical P systems
• Computing with membranes
• Using enzymatic numerical P systems for modeling mobile robot controllers
• Membrane computing. 10th international workshop, WMC 2009, Curtea de Arges, Romania, August 24--27, 2009. Revised selected and invited papers
• Unnamed Item

This page was built for publication: Universality of Enzymatic Numerical P systems