Game arguments in computability theory and algorithmic information theory
Logic
2012-09-11 v4 Computer Science and Game Theory
Information Theory
math.IT
Abstract
We provide some examples showing how game-theoretic arguments can be used in computability theory and algorithmic information theory: unique numbering theorem (Friedberg), the gap between conditional complexity and total conditional complexity, Epstein--Levin theorem and some (yet unpublished) result of Muchnik and Vyugin
Keywords
Cite
@article{arxiv.1204.0198,
title = {Game arguments in computability theory and algorithmic information theory},
author = {Andrej Muchnik and Alexander Shen and Mikhail Vyugin},
journal= {arXiv preprint arXiv:1204.0198},
year = {2012}
}
Comments
Extended version of a talk given at CiE2012 (Turing centennial) conference [see previous version for conference text]