Around Kolmogorov complexity: basic notions and results

DOI10.1007/978-3-319-21852-6_7zbMATH Open1338.68130arXiv1504.04955OpenAlexW2127798320WikidataQ57349398 ScholiaQ57349398MaRDI QIDQ2805718FDOQ2805718

Authors: A. Shen 

Publication date: 13 May 2016

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

Abstract: Algorithmic information theory studies description complexity and randomness and is now a well known field of theoretical computer science and mathematical logic. There are several textbooks and monographs devoted to this theory where one can find the detailed exposition of many difficult results as well as historical references. However, it seems that a short survey of its basic notions and main results relating these notions to each other, is missing. This report attempts to fill this gap and covers the basic notions of algorithmic information theory: Kolmogorov complexity (plain, conditional, prefix), Solomonoff universal a priori probability, notions of randomness (Martin-L"of randomness, Mises--Church randomness), effective Hausdorff dimension. We prove their basic properties (symmetry of information, connection between a priori probability and prefix complexity, criterion of randomness in terms of complexity, complexity characterization for effective dimension) and show some applications (incompressibility method in computational complexity theory, incompleteness theorems). It is based on the lecture notes of a course at Uppsala University given by the author.

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

Recommendations

• Kolmogorov complexity in perspective. I: Information theory and randomness
• Kolmogorov complexity as a language
• scientific article; zbMATH DE number 107774
• scientific article; zbMATH DE number 176218
• Algorithmic Complexity and Randomness: Recent Developments

zbMATH Keywords

survey paperKolmogorov complexityalgorithmic randomnesscomputabilityeffective Hausdorff dimension

Mathematics Subject Classification ID

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

Cited In (26)

• An additivity theorem for plain Kolmogorov complexity
• Kolmogorov Complexity and Algorithmic Randomness
• Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
• Complexity and randomness
• Kolmogorov Complexity: Sources, Theory and Applications
• Title not available (Why is that?)
• Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity
• Title not available (Why is that?)
• Normality, randomness and Kolmogorov complexity of continued fractions
• Kolmogorov complexity as a language
• A note on the Kolmogorov data complexity and nonuniform logical definitions
• Busy beavers and Kolmogorov complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Why Kolmogorov complexity?
• The deluge of spurious correlations in big data
• Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers
• Kolmogorov complexity in perspective. I: Information theory and randomness
• Towards an axiomatic system for Kolmogorov complexity
• Dimension 1 sequences are close to randoms
• Universal probability-free prediction
• Title not available (Why is that?)
• Algorithmic statistics: forty years later
• Title not available (Why is that?)
• Randomness Tests: Theory and Practice
• Some notes on Rissanen's stochastic complexity

This page was built for publication: Around Kolmogorov complexity: basic notions and results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805718)