We 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.

中文翻译：

---

通用学位中的最小对

我们证明了在非均匀通用度中有一个最小对，因此在统一通用度中也是如此。这一事实与 Igusa 的结果形成对比，即相对通用可计算性没有最小对，并回答了该领域几篇论文中提到的基本结构问题。