Add to ORKGAbstract: 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
Based on information theory, a number of entropy measures have been proposed since the 1990s to asse...
Chaotic systems share with stochastic processes several properties that make them almost undistingui...
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-54072-6_22In...
In this paper we present a first approach to the definition of different entropy measures for probab...
This paper is part of a series addressing the empirical/statistical distribution of the diversity of...
We construct a complexity measure from first principles, as an average over the ‘‘obstruction agains...
In this chapter we aim at presenting applications of notions from Information Theory to the study of...
The aim of the thesis is to define, develop, and consider applications of different measures of dyna...
Time series from chaotic and stochastic systems shape properties which can make it hard to distingui...
A generalized Statistical Complexity Measure (SCM) is a functional that characterizes the probabilit...
Many complexity measures are defined as the size of a minimal representation in a specific model cla...
We extend previously proposed measures of complexity, emergence, and self-organization to continuous...
This essay is a trial on measuring complexity in a three-trophic level system by using a convex func...
Since the second half of the last century, the concept of complexity has been studied to find and co...
We study how statistical complexity depends on the system size and how the complexity of the whole s...
Based on information theory, a number of entropy measures have been proposed since the 1990s to asse...
Chaotic systems share with stochastic processes several properties that make them almost undistingui...
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-54072-6_22In...
In this paper we present a first approach to the definition of different entropy measures for probab...
This paper is part of a series addressing the empirical/statistical distribution of the diversity of...
We construct a complexity measure from first principles, as an average over the ‘‘obstruction agains...
In this chapter we aim at presenting applications of notions from Information Theory to the study of...
The aim of the thesis is to define, develop, and consider applications of different measures of dyna...
Time series from chaotic and stochastic systems shape properties which can make it hard to distingui...
A generalized Statistical Complexity Measure (SCM) is a functional that characterizes the probabilit...
Many complexity measures are defined as the size of a minimal representation in a specific model cla...
We extend previously proposed measures of complexity, emergence, and self-organization to continuous...
This essay is a trial on measuring complexity in a three-trophic level system by using a convex func...
Since the second half of the last century, the concept of complexity has been studied to find and co...
We study how statistical complexity depends on the system size and how the complexity of the whole s...
Based on information theory, a number of entropy measures have been proposed since the 1990s to asse...
Chaotic systems share with stochastic processes several properties that make them almost undistingui...
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-54072-6_22In...