| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 424415 | Electronic Notes in Theoretical Computer Science | 2007 | 15 Pages |
Abstract
We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
