Information and dynamical systems: A concrete measurement on sporadic dynamics (Q5954869): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127006773, #quickstatements; #temporary_batch_1724938403945
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: Q3314114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sporadicity: Between periodic and chaotic dynamical behaviors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial foundations of information theory and the calculus of probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of individual sequences via variable-rate coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic complexity of points in dynamical systems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0960-0779(01)00028-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079567213 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127006773 / rank
 
Normal rank

Latest revision as of 15:46, 29 August 2024

scientific article; zbMATH DE number 1702132
Language Label Description Also known as
English
Information and dynamical systems: A concrete measurement on sporadic dynamics
scientific article; zbMATH DE number 1702132

    Statements

    Information and dynamical systems: A concrete measurement on sporadic dynamics (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2002
    0 references
    This paper presents a method for the study of dynamical systems based on the notation of quantity of information contained in a string. From a matematical point of view the most powerful way to define this quantity is given by the Kolmogorov complexity, or algorithmic information content (shortly AIC). The authors introduce a new compression algorithm called CASToRe which allows a direct estimation of the information content of the orbits in the \(O\)-entropy case. The method is applied to a sporadic dynamical system.
    0 references
    0 references
    0 references
    0 references
    0 references
    sporadic dynamics
    0 references
    Kolmogorov complexity
    0 references
    entropy
    0 references
    0 references
    0 references