| Résume | We discuss a number of uniform dichotomies for problems in the Weihrauch lattice. Such dichotomies have the common form that a problem is either quite well-behaved (continuous, measurable of some form, etc.) or already relatively badly behaved. We show that often such dichotomies also have non-uniform versions and we indicate how computability concepts such as Turing jumps, Weak König's Lemma, diagonal non-computability, etc. occur naturally in these non-uniform versions. We also discuss how some known dichotomies from descriptive set theory, such as Solecki's dichotomy, can be seen in this context. |
