Joining non-low CE sets with diagonally non-computable functions
We show that every non-low c.e. set joins all delta(0)(2) diagonally non-computable functions to empty set'. We give two proofs: a direct argument, and a proof using an analysis of functions that are DNC relative to an oracle, extending work by Day and Reimann. The latter proof is also presented in the language of Kolmogorov complexity.
sets diagonally non-computable functions kolmogorov complexity non-low c e