34 citations · 54 across the 14 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2025★ 2 cited
Computably discrete represented spaces
Eike Neumann, Arno Pauly, Cécilia Pradic +1
In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial s…
math.LO2015★ 34 cited
Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees
Eike Neumann
We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of comput…