Sciweavers

BSL
2005
70views more  BSL 2005»
14 years 11 days ago
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 i...
Stephen G. Simpson