Lecture notes on descriptional complexity and randomness
Information Theory
2021-05-12 v1 math.IT
Abstract
A didactical survey of the foundations of Algorithmic Information Theory. These notes are short on motivation, history and background but introduce some of the main techniques and concepts of the field. The "manuscript" has been evolving over the years. Please, look at "Version history" below to see what has changed when.
Cite
@article{arxiv.2105.04704,
title = {Lecture notes on descriptional complexity and randomness},
author = {Peter Gacs},
journal= {arXiv preprint arXiv:2105.04704},
year = {2021}
}
Comments
181 pages. arXiv admin note: text overlap with arXiv:cs/0312039