Turing Completeness Using Three Mobile Membranes
From MaRDI portal
Publication:3184756
DOI10.1007/978-3-642-03745-0_12zbMath1253.68121OpenAlexW1839299395WikidataQ57936997 ScholiaQ57936997MaRDI QIDQ3184756
Publication date: 22 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03745-0_12
Related Items (12)
Computing by Endocytosis and Exocytosis ⋮ Solving SAT with P systems with anti-membranes ⋮ The power of synchronizing rules in membrane computing ⋮ On the efficiency of synchronized P systems ⋮ Reachability problems in BioAmbients ⋮ Computational Power of Protein Networks ⋮ Travelling salesman problem in tissue P systems with costs ⋮ Memory associated with membranes systems ⋮ Synchronization of rules in membrane computing ⋮ Efficiently solving the bin packing problem through bio-inspired mobility ⋮ Mutual mobile membranes with objects on surface ⋮ Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
This page was built for publication: Turing Completeness Using Three Mobile Membranes
