Game arguments in computability theory and algorithmic information theory

  • Authors:

  • Alexander Shen

  • Affiliations:

  • Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier (LIRMM), Université Montpellier 2, UMR 5506--CC477, Montpellier Cedex 5, France,On leave from Institute fo ...

  • Venue:
  • CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.