5 search results - page 1 / 1 » Maximal chains in the Turing degrees |
JSYML
2007
13 years 4 months ago
2007
We study the problem of existence of maximal chains in the Turing degrees. We show that:
CIE
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We study existence problems of maximal antichains in the Turing degrees. In particular, we give a characterization of the existence of a thin Π1 1 maximal antichains in ...
JSYML
2002
13 years 4 months ago
2002
A computably enumerable (c.e.) degree is a maximal contiguous degree if it is contiguous and no c.e. degree strictly above it is contiguous. We show that there are infinitely many ...
APAL
2007
13 years 4 months ago
2007
We study generalizations of shortest programs as they pertain to Schaefer’s MIN∗ problem. We identify sets of m-minimal and T-minimal indices and characterize their truth-tabl...
19
Voted
PERCOM
2007
ACM
14 years 4 months ago
2007
ACM
This paper develops a context aware framework to address the diverse communication needs of a modern enterprise. Such enterprises are characterized by workers in different locatio...