PARTIAL HALTING IN P SYSTEMS

DOI10.1142/S0129054107005261zbMath1183.68318OpenAlexW2029442843MaRDI QIDQ3401468

Marion Oswald, Rudolf Freund

Publication date: 29 January 2010

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

Full work available at URL: https://doi.org/10.1142/s0129054107005261

zbMATH Keywords

catalytic P systemdescriptional complexityhaltingantiport P system

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (5)

Variants of derivation modes for which purely catalytic P systems are computationally complete ⋮ Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete ⋮ Towards bridging two cell-inspired models: P systems and R systems ⋮ How derivation modes and halting conditions may influence the computational power of P systems ⋮ A Formal Framework for Static (Tissue) P Systems

Cites Work

• The power of communication: P systems with symport/antiport
• P systems with minimal parallelism
• Computing with membranes
• Computationally universal P systems without priorities: Two catalysts are sufficient

This page was built for publication: PARTIAL HALTING IN P SYSTEMS