Pages that link to "Item:Q3184756"
From MaRDI portal
The following pages link to Turing Completeness Using Three Mobile Membranes (Q3184756):
Displaying 17 items.
- Reachability problems in BioAmbients (Q418830) (← links)
- Efficiently solving the bin packing problem through bio-inspired mobility (Q530219) (← links)
- Mutual mobile membranes with objects on surface (Q553916) (← links)
- Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems (Q766179) (← links)
- Travelling salesman problem in tissue P systems with costs (Q1983010) (← links)
- Memory associated with membranes systems (Q1983012) (← links)
- Synchronization of rules in membrane computing (Q1983026) (← links)
- Turing completeness of water computing (Q2152298) (← links)
- Modeling multitape Minsky and Turing machines by three-tape Minsky machines (Q2226960) (← links)
- Turing Tumble is Turing-complete (Q2683507) (← links)
- On the Computability Power of Membrane Systems with Controlled Mobility (Q2904459) (← links)
- Computing by endocytosis and exocytosis (Q2919579) (← links)
- Computational Power of Protein Networks (Q2975906) (← links)
- Computability Power of Mobility in Enhanced Mobile Membranes (Q3091452) (← links)
- Solving SAT with P systems with anti-membranes (Q6048241) (← links)
- The power of synchronizing rules in membrane computing (Q6118652) (← links)
- On the efficiency of synchronized P systems (Q6135703) (← links)