On the existence of a strong minimal pair
Abstract
We show that there is a strong minimal pair in the computably enumerable Turing degrees.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.