Given two distributional problems, we wish to know which one is computationally more difficult. The standard technique for such comparisons is to find a reduction from one problem to another. Levin [Lev86] provided a notion of reduction. Gurevich [Gur91a] advanced this theory in several ways that, at the same time, made Levin's ideas more accessible.