Sciweavers

14704 search results - page 165 / 2941
» computer 2007
Sort
View
141
Voted
APAL
1998
121views more  APAL 1998»
15 years 4 months ago
Computably Enumerable Sets and Quasi-Reducibility
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
Rodney G. Downey, Geoffrey LaForte, André N...