Algorithmic complexity of points in dynamical systems (Q4290052): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Universal coding, information, prediction, and estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergodic theory on compact spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal almost sure data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Any code of which we cannot think is good / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Length of Programs for Computing Finite Binary Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF THE TRAJECTORIES OF A DYNAMICAL SYSTEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic optimality and asymptotic equipartiton properties of log- optimum investment / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Finite Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sample converses in source coding theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subsequences of normal sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of strictly ergodic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal noiseless coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Von Mises' definition of random sequences reconsidered / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can an individual sequence of zeros and ones be random? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process complexity and effective random tests / rank
 
Normal rank

Latest revision as of 15:21, 22 May 2024

scientific article; zbMATH DE number 558769
Language Label Description Also known as
English
Algorithmic complexity of points in dynamical systems
scientific article; zbMATH DE number 558769

    Statements

    Algorithmic complexity of points in dynamical systems (English)
    0 references
    0 references
    14 July 1994
    0 references
    algorithmic complexity
    0 references
    orbits of points
    0 references
    dynamical systems
    0 references
    topological entropy
    0 references

    Identifiers