A note on complexity measures for probabilistic P systems

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. © J.UCS.

Año de publicación:

2004

Keywords:

• P systems
• Natural Computing
• entropy

Fuente:

scopus