Abstract
AbstractWe show that there is a minimal pair in the nonuniform generic degrees, and hence also in the uniform generic degrees. This fact contrasts with Igusa’s result that there are no minimal pairs for relative generic computability and answers a basic structural question mentioned in several papers in the area.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have