Weihrauch-completeness for layerwise computability
arXiv:1505.02091 · doi:10.23638/LMCS-14(2:11)2018
Abstract
We introduce the notion of being Weihrauch-complete for layerwise computability and provide several natural examples related to complex oscillations, the law of the iterated logarithm and Birkhoff's theorem. We also consider hitting time operators, which share the Weihrauch degree of the former examples but fail to be layerwise computable.
References in corpus (8)
- 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
- Probabilistic Computability and Choice
- On the algebraic structure of Weihrauch degrees
- The degree structure of Weihrauch-reducibility
- Non-deterministic computation and the Jayne-Rogers Theorem
- Infinite Oracle Queries in Type-2 Machines (Extended Abstract)