3 papers
math.LO2013
Density, forcing, and the covering problem
Adam R. Day, Joseph S. Miller
We present a notion of forcing that can be used, in conjunction with other results, to show that there is a Martin-Löf random set X such that X does not compute 0' and X computes e…
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…