Turing Completeness Using Three Mobile Membranes

DOI10.1007/978-3-642-03745-0_12MaRDI QIDQ3184756zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Bogdan Aman, Gabriel Ciobanu

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Mobile membranes: computability and complexity
• Computability power of mobility in enhanced mobile membranes
• On the computability power of membrane systems with controlled mobility
• Logical Approaches to Computational Barriers
• P systems with mobile membranes

Cited in

(18)

• Travelling salesman problem in tissue P systems with costs
• Memory associated with membranes systems
• Synchronization of rules in membrane computing
• Turing completeness of water computing
• Modeling multitape Minsky and Turing machines by three-tape Minsky machines
• Turing Tumble is Turing-complete
• Mobile membranes: computability and complexity
• On the computability power of membrane systems with controlled mobility
• Computing by endocytosis and exocytosis
• Computational power of protein networks
• Computability power of mobility in enhanced mobile membranes
• Reachability problems in BioAmbients
• Efficiently solving the bin packing problem through bio-inspired mobility
• Mutual mobile membranes with objects on surface
• Solving SAT with P systems with anti-membranes
• The power of synchronizing rules in membrane computing
• On the efficiency of synchronized P systems
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184756)