This tutorial gives a brief introduction to computable analysis. The objective of this theory is
to study algorithmic aspects of real numbers, real number functions, subsets of real …

Is the exponential function computable? Are union and intersection of closed subsets of the
real plane computable? Are differentiation and integration computable operators? Is zero …

The notions “recursively enumerable” and “recursive” are the basic notions of effectivity in
classical recursion theory. In computable analysis, these notions are generalized to closed …

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 …

In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more
precisely, a natural extension for multi-valued functions on represented spaces. We call the …

In this paper we introduce and compare computability concepts on the set of closed subsets
of Euclidean space. We use the language and framework of Type 2 Theory of Effectivity …

In this paper we study a new approach to classify mathematical theorems according to their
computational content. Basically, we are asking the question which theorems can be …

We classify the computational content of the Bolzano–Weierstraß Theorem and variants
thereof in the Weihrauch lattice. For this purpose we first introduce the concept of a …

The investigation of computational properties of discontinuous functions is an important
concern in computable analysis. One method to deal with this subject is to consider effective …

According to the Church-Turing Thesis a number function is computable by the
mathematically defined Turing machine if and only if it is computable by a physical machine …