1 problem

The nonzero-degree conjecture for sets of density one that are not coarsely computable
arXiv@arxiv
A set $A$ has coarse computability bound $b3(A)=1$ when its coarse computability bound is one, but is not coarsely computable. The surrounding results show that if either the Turin…
Conjectureopencoarse-computability computability-theory turing-degrees
1

The nonzero-degree conjecture for sets of density one that are not coarsely computable