Game arguments in computability theory and algorithmic information theory

Details Game arguments in computability theory and algorithmic information theory Game arguments in computability theory and algorithmic information theory

2012-04-01

arxiv.org/abs/1204.0198v1

Mathematics

Logic

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Game arguments in computability theory and algorithmic information theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Game arguments in computability theory and algorithmic information theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Game arguments in computability theory and algorithmic information theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-552446