Mass problems and randomness

A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P is strongly reducible to Q if every member of Q Turing computes a member of P via a fixed Turing functional. The weak degrees and strong degrees are the equivalence classes of mass problems under weak and strong reducibility, respectively. We focus on the countable distributive lattices Pw and Ps of weak and strong degrees of mass problems given by nonempty 0 1 subsets of 2 . Using an G

• Type: Journal
• Year: 2005
• Where: BSL
• Authors: Stephen G. Simpson
• Keywords: BSL 2005, Mass Problems, Turing, Weak Degrees