Back to Search
Start Over
A Cappable Almost Everywhere Dominating Computably Enumerable Degree.
- Source :
- ENTCS: Electronic Notes in Theoretical Computer Science; Jan2007, Vol. 167, p17-31, 15p
- Publication Year :
- 2007
-
Abstract
- Abstract: We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 15710661
- Volume :
- 167
- Database :
- Supplemental Index
- Journal :
- ENTCS: Electronic Notes in Theoretical Computer Science
- Publication Type :
- Periodical
- Accession number :
- 23754659
- Full Text :
- https://doi.org/10.1016/j.entcs.2006.08.005