Weihrauch Complexity in Computable Analysis Page 1 Chapter 11 Weihrauch Complexity in
Computable Analysis Vasco Brattka, Guido Gherardi and Arno Pauly Abstract We provide a …

We investigate the topological aspects of some algebraic computation models, in particular
the BSS-model. Our results can be seen as bounds on how different BSS-computability and …

We introduce two new operations (compositional products and implication) on Weihrauch
degrees, and investigate the overall algebraic structure. The validity of the various …

In this work we investigate the Weihrauch degree of the problem Decreasing Sequence () of
finding an infinite descending sequence through a given ill-founded linear order, which is …

In this paper we study the notion of first-order part of a computational problem, first
introduced in [17], which captures the “strongest computational problem with codomain N …

There are close similarities between the Weihrauch lattice and the zoo of axiom systems in
reverse mathematics. Following these similarities has often allowed researchers to translate …

We introduce a framework for online structure theory. Our approach generalises notions
arising independently in several areas of computability theory and complexity theory. We …

We study the uniform computational content of Ramsey's theorem in the Weihrauch lattice.
Our central results provide information on how Ramsey's theorem behaves under product …

We systematically study the completion of choice problems in the Weihrauch lattice. Choice
problems play a pivotal rôle in Weihrauch complexity. For one, they can be used as …

This paper is a contribution to the growing investigation of strong reducibilities between. The
last result also extends a prior result of Dzhafarov [9]. We introduce a number of new …