1 citations · 1 across the 4 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
Limits to joining with generics and randoms
Adam R. Day, Damir D. Dzhafarov
Posner and Robinson (1981) proved that if is non-computable, then there exists a such that . Shore and Slaman (1999) extended…