Game arguments in computability theory and algorithmic information theory
arXiv:1204.0198
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
Extended version of a talk given at CiE2012 (Turing centennial) conference [see previous version for conference text]