On a powerful class of non-universal P systems with active membranes

Authors:
Antonio E. Porreca;Alberto Leporati;Claudio Zandron
Affiliations:
Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Milano, Italy;Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Milano, Italy;Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Milano, Italy
Venue:
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Year:
2010

Citing 7
Cited 0

Computing with membranes

Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
A guide to membrane computing

Theoretical Computer Science - Natural computing
Complexity classes in models of cellular computing with membranes

Natural Computing: an international journal
The computational power of cell division in P systems: Beating down parallel computers?

Natural Computing: an international journal
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing
P systems with active membranes: trading time for space

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally universal. However, they are powerful enough to solve exactly the problems solvable by Turing machines operating in time and space that are "tetrational" (i.e., bounded by a stack of exponentials of polynomial height) with respect to the size of the input.