A Cappable Almost Everywhere Dominating Computably Enumerable Degree

Authors:
George Barmpalias;Antonio Montalbán
Affiliations:
School of Mathematics, University of Leeds, Leeds LS2 9JT, U.K.;Department of Mathematics, University of Chicagom, 5734 S. University ave. Chicago, IL 60637, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 1
Cited 2

Recursively enumerable sets and degrees

Recursively enumerable sets and degrees

Non-cupping, measure and computably enumerable splittings

Mathematical Structures in Computer Science
Working with the LR degrees

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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