On the existence of a strong minimal pair

2016/10/12 by George Barmpalias, Barmpalias, George, Mingzhong Cai +5
Computer Science · #Cellular Automata and Applications #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1610.03591

openalex publication_date 2016/10/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We show that there is a strong minimal pair in the computably enumerable Turing degrees.

Related

• On the Nonexistence of a Strong Minimal Pair
• Π⁰₁ classes, strong minimal covers and hyperimmune-free degrees
• Nonexistence of Minimal Pairs for Generic Computability
• DNR and incomparable Turing degrees
• Realizing Computably Enumerable Degrees in Separating Classes