Around Kolmogorov Complexity: Basic Notions and Results

DOI10.1007/978-3-319-21852-6_7zbMath1338.68130arXiv1504.04955OpenAlexW2127798320WikidataQ57349398 ScholiaQ57349398MaRDI QIDQ2805718

Alexander Shen

Publication date: 13 May 2016

Published in: Measures of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.04955

zbMATH Keywords

Kolmogorov complexitysurvey papercomputabilityalgorithmic randomnesseffective Hausdorff dimension

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (10)

Randomness Tests: Theory and Practice ⋮ Busy Beavers and Kolmogorov Complexity ⋮ The deluge of spurious correlations in big data ⋮ Automatic Kolmogorov complexity, normality, and finite-state dimension revisited ⋮ Dimension 1 sequences are close to randoms ⋮ Universal probability-free prediction ⋮ Normality, randomness and Kolmogorov complexity of continued fractions ⋮ Unnamed Item ⋮ Algorithmic Statistics: Forty Years Later ⋮ On algorithmic statistics for space-bounded algorithms

This page was built for publication: Around Kolmogorov Complexity: Basic Notions and Results