A capable almost everywhere dominating computably enumerable degree


G. Barmpalias and A. Montalban

Summary


We show that there exists an almost everywhere dominating computably enumerable degree which is half of a minimal pair.