Artículo
A Note on Complexity Measures for Probabilistic P Systems
Autor/es | Cordón Franco, Andrés
Sancho Caparrini, Fernando |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2004 |
Fecha de depósito | 2019-07-04 |
Publicado en |
|
Resumen | 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. ... 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. |
Identificador del proyecto | TIC2002-04220-C03-01 |
Cita | Cordón Franco, A. y Sancho Caparrini, F. (2004). A Note on Complexity Measures for Probabilistic P Systems. Journal of Universal Computer Science, 10 (5), 559-566. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
A Note on Complexity Measures.pdf | 105.5Kb | [PDF] | Ver/ | |