A Cappable Almost Everywhere Dominating Computably Enumerable Degree

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