A Note on Complexity Measures for Probabilistic P Systems
| Title | A Note on Complexity Measures for Probabilistic P Systems |
| Publication Type | Journal Papers |
| Year of Publication | 2004 |
| Authors | Cordón-Franco, A., & Sancho-Caparrini F. |
| Journal Title | Journal of Universal Computer Science |
| Place Published | Granz Austria |
| Volume | 10 |
| Pages | 559-566 |
| 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 |
| URL | http://www.jucs.org/jucs_10_5/a_note_on_complexity |
| Issue | 5 |
| Attachment | Size |
|---|---|
| A note on Complexity Measures....pdf | 105.27 KB |
Research Group on Natural Computing (PAI - TIC 193)
Department of Computer Science and Artificial Intelligence
University of Seville
Webmasters: the members of the RGNC
| Follow us: |  |
 |
|
Featured News: |
|
Mario J. Pérez-Jiménez in the top 2% of scientists of the World |
|
Agustín became Full Professor |
|
Science names our most recent research project |