Weihrauch-completeness for layerwise computabilityArticle
Authors: Arno Pauly ; Willem Fouché ; George Davie
NULL##NULL##NULL
Arno Pauly;Willem Fouché;George Davie
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.
Computing with Infinite Data; Funder: European Commission; Code: 731143
Computable Analysis; Funder: European Commission; Code: 294962
Bibliographic References
2 Documents citing this article
Ethan McCarthy, 2021, Pointwise complexity of the derivative of a computable function, Archive for Mathematical Logic, 60, 7-8, pp. 981-994, 10.1007/s00153-021-00769-4.
Guido Gherardi;Alberto Marcone;Arno Pauly, 2019, Projection operators in the Weihrauch lattice, arXiv (Cornell University), 8, 3-4, pp. 281-304, 10.3233/com-180207, https://arxiv.org/abs/1805.12026.