A characterization of constructive dimension
From MaRDI portal
Publication:3619871
DOI10.1002/MALQ.200710087zbMATH Open1175.03027OpenAlexW2031813488MaRDI QIDQ3619871FDOQ3619871
Authors: S. Nandakumar 
Publication date: 9 April 2009
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.200710087
Recommendations
Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cites Work
- Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups
- Algorithmic randomness and complexity.
- Two definitions of fractional dimension
- The dimensions of individual strings and sequences
- The definition of random sequences
- Ergodic theorems for individual random sequences
- A unified approach to the definition of random sequences
- Almost everywhere high nonuniform complexity
- Title not available (Why is that?)
- Gales suffice for constructive dimension
- Title not available (Why is that?)
- STACS 2004
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scaled dimension and nonuniform complexity
- Dimensions of Points in Self-similar Fractals
Cited In (6)
- A Correspondence Principle for Exact Constructive Dimension
- The dimensions of individual strings and sequences
- A Characterization of Constructive Dimension
- Random sequences with respect to a measure defined by two linear fractional transformations
- Gales suffice for constructive dimension
- Title not available (Why is that?)
This page was built for publication: A characterization of constructive dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3619871)
