相关论文: Complexity for extended dynamical systems

A definition of entropy via the Kolmogorov algorithmic complexity is discussed. As examples, we show how the meanfield theory for the Ising model, and the entropy of a perfect gas can be recovered. The connection with computations are…

For any discrete time dynamical system with a rational evolution, we define an entropy, which is a global index of complexity for the evolution map. We analyze its basic properties and its relations to the singularities and the…

We discuss the Kolmogorov's entropy and Sinai's definition of it; and then define a deformation of the entropy, called {\it scaling entropy}; this is also a metric invariant of the measure preserving actions of the group, which is more…

Some established and also novel techniques in the field of applications of algorithmic (Kolmogorov) complexity currently co-exist for the first time and are here reviewed, ranging from dominant ones such as statistical lossless compression…

In classical information theory, entropy rate and Kolmogorov complexity per symbol are related by a theorem of Brudno. In this paper, we prove a quantum version of this theorem, connecting the von Neumann entropy rate and two notions of…

Time correlated fluctuations interacting with a spatial asymmetry potential are sufficient conditions to give rise to transport of Brownian particles. The transfer of information coming from the nonequilibrium bath, viewed as a source of…

We introduce a new concept of finite-time entropy which is a local version of the classical concept of metric entropy. Based on that, a finite-time version of Pesin's entropy formula and also an explicit formula of finite-time entropy for…

The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is chosen and a general algorithm is presented. The correctness of…

Information entropy is applied to the analysis of time series generated by dynamical systems. Complexity of a temporal or spatio-temporal signal is defined as the difference between the sum of entropies of the local linear regions of the…

We develop a theory of classical complexity. We study the relations between classical complexity and entropy, and conjecture that in an isolated system, classical absolute complexity always tends to grow, until it reaches its maximum. We…

We analyze the behaviour of two quantum dynamical entropies in connection with the classical limit. Using strongly chaotic classical dynamical systems as models (Arnold Cat Maps and Sawtooth Maps), we also propose a discretization procedure…

Observing how long a dynamical system takes to return to some state is one of the most simple ways to model and quantify its dynamics from data series. This work proposes two formulas to estimate the KS entropy and a lower bound of it, a…

Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory -- in the discrete setting of bits and Turing machines. Over real numbers, on the other hand, the…

A formal definition of epsilon-complexity of an individual continuous function defined on a unit cube is proposed. This definition is consistent with the Kolmogorov's idea of the complexity of an object. A definition of epsilon-complexity…

We survey the diverse approaches to the notion of information content: from Shannon entropy to Kolmogorov complexity. The main applications of Kolmogorov complexity are presented namely, the mathematical notion of randomness (which goes…

We study systems with periodically oscillating parameters that can give way to complex periodic or non periodic orbits. Performing the long time limit, we can define ergodic averages such as Lyapunov exponents, where a negative maximal…

While the notion of chaos is well established for dynamical systems on manifolds, it is not so for dynamical systems over discrete spaces with $ N $ variables, as binary neural networks and cellular automata. The main difficulty is the…

Kolmogorov introduced a concept of Epsilon-entropy to analyze information in classical continuous system. The fractal dimension of geometrical sets was introduced by Mandelbrot as a new criterion to analyze the complexity of these sets. The…

It is generally believed that the dynamics of simple fluids can be considered to be chaotic, at least to the extent that they can be modeled as classical systems of particles interacting with short range, repulsive forces. Here we give a…

We consider free fermion systems in arbitrary dimensions and represent the occupation pattern of each eigenstate as a classical binary string. We find that the Kolmogorov complexity of the string correctly captures the scaling behavior of…