The following pages link to (Q4501143):
Displayed 8 items.
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- Computability in linear algebra (Q703545) (← links)
- Computability on subsets of Euclidean space. I: Closed and compact subsets (Q1292398) (← links)
- An effective Riemann Mapping Theorem (Q1292405) (← links)
- Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma (Q1919765) (← links)
- Decidability in analysis (Q2572942) (← links)
- Singular coverings and non‐uniform notions of closed set computability (Q3528149) (← links)
- Singular Coverings and Non-Uniform Notions of Closed Set Computability (Q4918031) (← links)