A Note on Complexity Measures for Probabilistic P Systems

Andrés Cordón-Franco (University of Sevilla, Spain)

Fernando Sancho-Caparrini (University of Sevilla, Spain)

Abstract: In this paper we present a first approach to the definition of different entropy measures for probabilistic P systems in order to obtain some quantitative parameters showing how complex the evolution of a P system is. To this end, we define two possible measures, the first one to reflect the entropy of the P system considered as the state space of possible computations, and the second one to reflect the change of the P system as it evolves.

Keywords: Entropy, Natural Computing, P systems

Categories: F.1.1, G.2.2, H.1.1