75 citations
- Université Paris CitéFR59 papers
- Centre National de la Recherche ScientifiqueFR32 papers
- Délégation Paris 7FR10 papers
- Institut national de recherche en sciences et technologies du numériqueFR9 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR8 papers
- Laboratoire d'Informatique de l'École PolytechniqueFR5 papers
- École Normale Supérieure de LyonFR4 papers
- Sorbonne UniversitéFR4 papers
- École PolytechniqueFR3 papers
- Laboratoire de Recherche en InformatiqueFR3 papers
- Laboratoire d'Informatique, de Robotique et de Microélectronique de MontpellierFR3 papers
- Orange (France)FR3 papers
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…