Small (purely) catalytic P systems simulating register machines

DOI10.1016/j.tcs.2015.09.020zbMath1336.68075OpenAlexW2144886602MaRDI QIDQ264529

Miroslav Langer, Petr Sosík

Publication date: 31 March 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.09.020

zbMATH Keywords

universal computationmembrane computingcatalytic P systemregister machine

Mathematics Subject Classification ID

Related Items (5)

The computational power of tissue-like P systems with promoters ⋮ An efficient time-free solution to QSAT problem using P systems with proteins on membranes ⋮ P Systems Working in Maximal Variants of the Set Derivation Mode ⋮ How derivation modes and halting conditions may influence the computational power of P systems ⋮ Proof techniques in membrane computing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Small universal register machines
• Computing with membranes
• Computationally universal P systems without priorities: Two catalysts are sufficient
• Catalytic P systems, semilinear sets, and vector addition systems
• Variants of Small Universal P Systems with Catalysts
• P Systems with Toxic Objects
• Membrane Computing

This page was built for publication: Small (purely) catalytic P systems simulating register machines