Limit-depth and DNR degrees

We introduce the notion of limit-depth, as a notion similar to Bennett depth, but well behaved on Turing degrees, as opposed to truth-table degrees for Bennett depth. We show limit-depth satisfies similar properties to Bennett depth, namely both recursive and sufficiently random sequences are not limit-deep, and limit-depth is preserved over Turing degrees. We show both the halting problem and Chaitin’s omega are limit-deep. We show every limit-deep set has DNR wtt-degree, and some limit-cuppable set does not have a limit-deep wtt degree