  We demonstrate that the Weihrauch lattice can be used to classify the uniform
computational content of computability-theoretic properties as well as the
computational content of theorems in one common setting. The properties that we
study include diagonal non-computability, hyperimmunity, complete consistent
extensions of Peano arithmetic, 1-genericity, Martin-L\"of randomness, and
cohesiveness. The theorems that we include in our case study are the low basis
theorem of Jockusch and Soare, the Kleene-Post theorem, and Friedberg's jump
inversion theorem. It turns out that all the aforementioned properties and many
theorems in computability theory, including all theorems that claim the
existence of some Turing degree, have very little uniform computational
content: they are located outside of the upper cone of binary choice (also
known as LLPO); we call problems with this property indiscriminative. Since
practically all theorems from classical analysis whose computational content
has been classified are discriminative, our observation could yield an
explanation for why theorems and results in computability theory typically have
very few direct consequences in other disciplines such as analysis. A notable
exception in our case study is the low basis theorem which is discriminative.
This is perhaps why it is considered to be one of the most applicable theorems
in computability theory. In some cases a bridge between the indiscriminative
world and the discriminative world of classical mathematics can be established
via a suitable residual operation and we demonstrate this in the case of the
cohesiveness problem and the problem of consistent complete extensions of Peano
arithmetic. Both turn out to be the quotient of two discriminative problems.
