On the existence of a strong minimal pair

12 Oct 2016  ·  Barmpalias George, Cai Mingzhong, Lempp Steffen, Slaman Theodore A. ·

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

PDF Abstract

Code
Add Remove Mark official

No code implementations yet. Submit your code now

Categories

Logic
Contact us on: hello@paperswithcode.com . Papers With Code is a free resource with all data licensed under CC-BY-SA.
Terms Data policy Cookies policy