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.
Publisher
Cambridge University Press (CUP)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Asymptotic Density and Computability;Russian Mathematics;2021-10
2. Computing sets from all infinite subsets;Transactions of the American Mathematical Society;2021-08-30