Toward a quantitative theory of self-generated complexity (Q1084370): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56687828, #quickstatements; #temporary_batch_1712272666262
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3893024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3908199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergodic theory of chaos and strange attractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative universality for a class of nonlinear transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The universal metric properties of nonlinear transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear oscillations, dynamical systems, and bifurcations of vector fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic properties of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5801644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An answer to a question by J. Milnor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation theory of cellular automata / rank
 
Normal rank

Latest revision as of 17:35, 17 June 2024

scientific article
Language Label Description Also known as
English
Toward a quantitative theory of self-generated complexity
scientific article

    Statements

    Toward a quantitative theory of self-generated complexity (English)
    0 references
    0 references
    1986
    0 references
    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 measure-theoretic 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 individual patterns, but either measure-theoretic or algebraic properties of ensembles of patterns arising in a priori translationally invariant situations. Numerical estimates of these complexities are given for several examples of patterns created by maps and by cellular automata.
    0 references
    0 references
    0 references
    0 references
    0 references
    measures of complexity of patterns arising in physical situations
    0 references
    quantities
    0 references
    observables
    0 references
    Shannon information
    0 references
    patterns created by maps and by cellular automata
    0 references
    0 references
    0 references