Deposito de Investigacion Universidad de Sevilla (University of Seville) · 2006 · 13 citations · 7 references
ComputingComputer ScienceMathematicsInformation TheoryScientific ComputingTheory Of ComputationComputability TheoryComputational ComplexityUniversality Problem
We prove that P systems with mate and drip operations and using at most \nfive membranes during any step of a computation are universal. This improves a recent \nsimilar result from, where eleven membranes are used. The proof of this result has the \n"drawback" that the output of a computation is obtained on an inner membrane of the \nsystem. A universality proof is then given for the case when the result of a computation is \nfound on the skin membrane (on its external side, hence "visible" from the environment), \nbut in this case we use one more membrane, as well as another basic brane operation \nexo; moreover, the operations are now of the projective type, as introduced in.
7
Computation: Finite and Infinite Machines.
D. A. Clarke, Marvin Minsky · American Mathematical Monthly · 1968 · 2.6K citations
P Systems with Proteins on Membranes
Andrei Păun, Bianca Popa · Fundamenta Informaticae · 2006 · 60 citations
Interactions of Biological Membranes
Brane Calculi, Luca Cardelli · 2005 · 40 citations