## Abstract In the context of Kolmogorov's algorithmic approach to the foundations of probability, MartinβLΓΆf defined the concept of an individual random sequence using the concept of a constructive measure 1 set. Alternate characterizations use constructive martingales and measures of impossibilit
A Kolmogorov complexity characterization of constructive Hausdorff dimension
β Scribed by Elvira Mayordomo
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 49 KB
- Volume
- 84
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We investigate the Kolmogorov complexity of real numbers. Let K be the Kolmogorov complexity function; we determine the Hausdorff dimension and the topological dimension of the graph of K. Since these dimensions are different, the graph of the Kolmogorov complexity function of the real line forms a
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual probabilistic construction. It turns out that the best known bounds on the size of expanders and superconcentrators can be attained based on this method. In the case of (