20 citations · 33 across the 29 of their papers we have counts for
Showing 2016 · math.LOShow all
3 papers · 2 filters
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.
math.LO2016
A note on the differences of computably enumerable reals
George Barmpalias, Andrew Lewis-Pye
We show that given any non-computable left-c.e. real there exists a left-c.e. real such that for all left-c.e. reals and all right-c.e. reals . The proof is…
math.LO2016
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
George Barmpalias, Nan Fang, Andrew Lewis-Pye
Chaitin's number Omega is the halting probability of a universal prefix-free machine, and although it depends on the underlying enumeration of prefix-free machines, it is always Tu…