On evolution-communication P systems with energy having bounded and unbounded communication

Abstract

We explore the computing power of Evolution-Communication P systems with energy (ECPe systems) considering dynamical communication measures, ComN, ComR and ComW. These measures consider the number of communication steps, communication rules and total energy used per communication step, respectively. In this paper, we address a previous conjecture that states that only semilinear sets can be generated with bounded ComX, X∈ { N, R, W}. Our result on bounded ComW seems to support such conjecture while the conjecture is not true for bounded ComN and ComR. We also show that the class of recursively enumerable sets can be computed using ECPe systems with two membranes. This improves a previous result that makes use of four membranes to show computational completeness.