26 citations · 69 across the 8 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.LO2012★ 6 cited
Limit complexities revisited [once more]
Laurent Bienvenu, Andrej Muchnik, Alexander Shen +1
The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result of Vereshchagin saying tha…
math.LO2012★ 20 cited
Game arguments in computability theory and algorithmic information theory
Andrej Muchnik, Alexander Shen, Mikhail Vyugin
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…