The Kolmogorov complexity of infinite words (Q2383593): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997534682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4806962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partial randomness / 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: Finite state languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extent and density of sequences within the minimal-program complexity hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal-program complexity of pseudo-recursive and pseudo-random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological properties of omega context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression and entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correspondence principles for effective dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension in Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dimensions of individual strings and sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity oscillations in infinite binary sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3705346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity and effectiveness of prediction algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory) / 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: Q3926038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3030812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties of the Hausdorff dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov complexity and Hausdorff dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments in Language Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight upper bound on Kolmogorov complexity and uniformly optimal prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive dimension equals Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / 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: Q4485693 / 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

Latest revision as of 15:51, 26 June 2024

scientific article
Language Label Description Also known as
English
The Kolmogorov complexity of infinite words
scientific article

    Statements

    The Kolmogorov complexity of infinite words (English)
    0 references
    0 references
    19 September 2007
    0 references
    0 references
    Kolmogorov complexity
    0 references
    entropy of languages
    0 references
    \(\omega \)-languages
    0 references
    Hausdorff dimension
    0 references
    packing dimension
    0 references
    box-counting dimensions
    0 references
    subword complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references