101 citations · 688 across the 27 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
math.LO2009★ 74 cited
Effective Choice and Boundedness Principles in Computable Analysis
Vasco Brattka, Guido Gherardi
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 contin…
math.LO2009★ 69 cited
Weihrauch Degrees, Omniscience Principles and Weak Computability
Vasco Brattka, Guido Gherardi
In this paper we study Weihrauch reducibility for multi-valued functions on represented spaces. We call the corresponding equivalence classes Weihrauch degrees and we show that the…