16 citations · 54 across the 28 of their papers we have counts for
Showing 2012 · math.LOShow all
2 papers · 2 filters
math.LO2012
From Bi-immunity to Absolute Undecidability
Laurent Bienvenu, Rupert Hölzl, Adam R. Day
An infinite binary sequence A is absolutely undecidable if it is impossible to compute A on a set of positions of positive upper density. Absolute undecidability is a weakening of…
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…