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 t...
