101 citations · 688 across the 27 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.LO2026
Computability of the Hahn-Banach Theorem Revisited
Vasco Brattka, Christopher Sorg
Computational properties of the Hahn-Banach theorem have been studied in computable, constructive and reverse mathematics and in all these approaches the theorem is equivalent to w…
math.LO2026
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…