Toward a quantitative theory of self-generated complexity

  title={Toward a quantitative theory of self-generated complexity},
  author={Peter Grassberger},
  journal={International Journal of Theoretical Physics},
  • P. Grassberger
  • Published 1 September 1986
  • Computer Science
  • International Journal of Theoretical Physics
Quantities are defined operationally which qualify as measures of complexity of patterns arising in physical situations. Their main features, distinguishing them from previously used quantities, are the following: (1) they are measuretheoretic concepts, more closely related to Shannon entropy than to computational complexity; and (2) they are observables related to ensembles of patterns, not to individual patterns. Indeed, they are essentially Shannon information needed to specify not… 
Inferring the Dynamic, Quantifying Physical Complexity
Two approaches to the inverse problem of chaotic data analysis, estimating symbolic equations of motion and reconstructing minimal automata from chaotic data series, are reviewed.
General Remarks on Complexity
In the 1960s and 1970s it was found that nonlinear systems with only a few degrees of freedom are capable of creating a rich variety of behavior from regular to rather irregular features, later
Statistical Complexity. Applications in Electronic Systems
A statistical measure of complexity based on the interplay between the Shannon information and the separation of the set of accessible states to a system from the equiprobability distribution, i.e. the disequilibrium is introduced.
Complexity of Dynamics as Variability of Predictability
This work constructs a complexity measure from first principles, as an average over the “obstruction against prediction” of some observable that can be chosen by the observer, and shows that “complex” and “chaotic” are different notions of perception.
Complexity and forecasting in dynamical systems
We discuss ways of defining complexity in physics, and in particular for symbol sequences typically arising in autonomous dynamical systems. We stress that complexity should be distinct from
On complexity measures
It is shown in this paper that the concept of complexity inevitably comes to a rather general concept in the so‐called exact sciences, such as physics or chemistry, and has been applied for testing a model of the reversals of the Earth's magnetic field.
Quantifying self-organization with optimal predictors.
This Letter proposes a new criterion, namely, an internally generated increase in the statistical complexity, the amount of information required for optimal prediction of the system's dynamics, for spatially extended dynamical systems.


Computation theory of cellular automata
The sets of configurations generated after a finite number of time steps of cellular automaton evolution are shown to form regular languages and it is suggested that such undecidability is common in these and other dynamical systems.
A measure of degree of organization is proposed and discussed that is useful in discussions of the nature of life to be able to refer to analogous precisely defined concepts whose properties can be rigorously studied.
Algebraic properties of cellular automata
Algebraic techniques are used to give an extensive analysis of the global properties of a class of finite cellular automata, and the complete structure of state transition diagrams is derived in terms of algebraic and number theoretical quantities.
Statistical mechanics of cellular automata
Analysis is given of ''elementary'' cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to p definite rules involving the values of its nearest neighbors.
Ergodic theory of chaos and strange attractors
Physical and numerical experiments show that deterministic noise, or chaos, is ubiquitous. While a good understanding of the onset of chaos has been achieved, using as a mathematical tool the
Iterated maps on the interval as dynamical systems
Motivation and Interpretation.- One-Parameter Families of Maps.- Typical Behavior for One Map.- Parameter Dependence.- Systematics of the Stable Periods.- On the Relative Frequency of Periodic and
Quantitative universality for a class of nonlinear transformations
AbstractA large class of recursion relationsxn + 1 = λf(xn) exhibiting infinite bifurcation is shown to possess a rich quantitative structure essentially independent of the recursion function. The
The universal metric properties of nonlinear transformations
AbstractThe role of functional equations to describe the exact local structure of highly bifurcated attractors ofxn+1 =λf(xn) independent of a specificf is formally developed. A hierarchy of
To a mathematical definition of 'life'
A possible point of departure for a mathematical definition of 'life' is suggested, based on the computer, that is closely related to recent analyses of 'inductive inference' and 'randomness'.