Information measures for infinite sequences (Q974755): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q62038782 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2134836373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sophistication revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational depth: Concept and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-depth witnesses are easy to find / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth as randomness deficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Strong Dimension in Algorithmic Information and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An almost machine-independent theory of program-length complexity, sophistication, and induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3314114 / 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: Algorithmic statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to Kolmogorov complexity and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension in Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity oscillations in infinite binary sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Kolmogorov complexity characterization of constructive Hausdorff dimension. / 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: Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two definitions of fractional dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kolmogorov complexity of random reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic orbit complexity of infinite measure preserving transformations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:07, 2 July 2024

scientific article
Language Label Description Also known as
English
Information measures for infinite sequences
scientific article

    Statements

    Information measures for infinite sequences (English)
    0 references
    0 references
    0 references
    7 June 2010
    0 references
    Kolmogorov complexity
    0 references
    sophistication
    0 references
    computational depth
    0 references

    Identifiers