Publication:4501143
From MaRDI portal
zbMath0947.03079MaRDI QIDQ4501143
Publication date: 3 September 2000
03F60: Constructive and recursive analysis
03D45: Theory of numerations, effectively presented structures
52A99: General convexity
Related Items
Singular Coverings and Non-Uniform Notions of Closed Set Computability, Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra, Computability in linear algebra, Computability on subsets of Euclidean space. I: Closed and compact subsets, An effective Riemann Mapping Theorem, Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma, Decidability in analysis, Singular coverings and non‐uniform notions of closed set computability