A Kolmogorov complexity characterization of constructive Hausdorff dimension. (Q1853096): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714302 / 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: The complexity and effectiveness of prediction algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov complexity and Hausdorff dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight upper bound on Kolmogorov complexity and uniformly optimal prediction / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(02)00343-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076165639 / rank
 
Normal rank

Latest revision as of 10:08, 30 July 2024

scientific article
Language Label Description Also known as
English
A Kolmogorov complexity characterization of constructive Hausdorff dimension.
scientific article

    Statements

    A Kolmogorov complexity characterization of constructive Hausdorff dimension. (English)
    0 references
    0 references
    21 January 2003
    0 references
    Kolmogorov complexity
    0 references
    Information theory
    0 references
    Hausdorff dimension
    0 references
    Theory of computation
    0 references

    Identifiers