Projection operators in the Weihrauch lattice
arXiv:1805.12026 · doi:10.3233/COM-180207
Abstract
In this paper we study the Weihrauch complexity of projection operators onto closed subsets of the Euclidean space. We show that some fundamental degrees of the Weihrauch lattice can be characterized in terms of such operators.
arXiv commentA few changes following the referee report
References in corpus (12)
- Closed Choice and a Uniform Low Basis Theorem
- The Bolzano-Weierstrass Theorem is the Jump of Weak König's Lemma
- Effective Choice and Boundedness Principles in Computable Analysis
- Weihrauch Degrees, Omniscience Principles and Weak Computability
- Probabilistic Computability and Choice
- On the algebraic structure of Weihrauch degrees
- Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees
- On the (semi)lattices induced by continuous reducibilities
- Finite choice, convex choice and finding roots
- Turing machines on represented sets, a model of computation for Analysis
- Weihrauch-completeness for layerwise computability
- The Vitali Covering Theorem in the Weihrauch Lattice