Weihrauch-completeness for layerwise computability
Arno Pauly, Willem L. Fouché, George Elder Davie · Logical Methods in Computer Science · 2018
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.