Work

Game arguments in computability theory and algorithmic information theory

Year: 2012

Type: preprint

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

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1204.0198

Authors: Muchnik, Andrej, Shen, Alexander, Vyugin, Mikhail

Institutions: Centre National de la Recherche Scientifique, Russian Academy of Sciences, Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, Université Montpellier 2

Language: English

Topic: Computability, Logic, AI Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Russian Foundation for Basic Research

OpenAlex ID: W1543528596

Cites: 10

Cited by: 20

Related to: 20