Game arguments in computability theory and algorithmic information theory

In S. Barry Cooper (ed.), How the World Computes. pp. 655--666 (2012)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Algorithmic information theory.Michiel van Lambalgen - 1989 - Journal of Symbolic Logic 54 (4):1389-1400.
Algorithmic randomness and measures of complexity.George Barmpalias - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Is Evolution Algorithmic?Marcin Miłkowski - 2009 - Minds and Machines 19 (4):465-475.
Game-theoretic axioms for local rationality and bounded knowledge.Gian Aldo Antonelli & Cristina Bicchieri - 1995 - Journal of Logic, Language and Information 4 (2):145-167.

Analytics

Added to PP
2014-01-28

Downloads
31 (#445,254)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references