most citedRandom strings and tt-degrees of Turing complete C.E. sets

7 citations · 7 across the 2 of their papers we have counts for

collaborators
Showing math.LOShow all

1 paper · 1 filter

math.LO2016

On the existence of a strong minimal pair

George Barmpalias, Mingzhong Cai, Steffen Lempp +1

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