On the existence of a strong minimal pair
George Barmpalias, Mingzhong Cai, Steffen Lempp, Theodore A., Slaman
TL;DR
This paper proves the existence of a strong minimal pair within the computably enumerable Turing degrees, advancing understanding of their structural properties.
Contribution
It establishes the first known example of a strong minimal pair in the c.e. Turing degrees, revealing new insights into their complexity.
Findings
Existence of a strong minimal pair in c.e. Turing degrees
Provides a construction demonstrating the pair's properties
Enhances understanding of the structure of c.e. degrees
Abstract
We show that there is a strong minimal pair in the computably enumerable Turing degrees.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · Cellular Automata and Applications