| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436100 | Theoretical Computer Science | 2009 | 12 Pages |
Abstract
It is shown that holds for every n>1, where is the upper semi-lattice of all computably enumerable (c.e.) degrees for m>0, giving a first elementary difference among the highness hierarchies of the c.e. degrees.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
