5 papers
Uniform Computability of PAC Learning
Vasco Brattka, Guillaume Chirache
We study uniform computability properties of PAC learning using Weihrauch complexity. We focus on closed concept classes, which are either represented by positive, by negative or b…
Effective bases and notions of effective second countability in computable analysis
Vasco Brattka, Emmanuel Rauzy
We investigate different notions of "computable topological base" for represented spaces. We show that several non-equivalent notions of bases become equivalent when we consider co…
Loops, Inverse Limits and Non-Determinism
Vasco Brattka
We introduce an operator on problems in Weihrauch complexity, which we call the inverse limit, and which corresponds to an infinite compositional product. This operation arises nat…
Computability of Initial Value Problems
Vasco Brattka, Hendrik Smischliaew
We demonstrate that techniques of Weihrauch complexity can be used to get easy and elegant proofs of known and new results on initial value problems. Our main result is that solvin…
Completion of Choice
Vasco Brattka, Guido Gherardi
We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal role in Weihrauch complexity. For one, they can be used as landma…