Weihrauch-completeness for layerwise computability

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...

Full description

Bibliographic Details
Main Authors: Arno Pauly, Willem Fouché, George Davie
Format: Article
Language:English
Published: Logical Methods in Computer Science e.V. 2018-05-01
Series:Logical Methods in Computer Science
Subjects:
Online Access:https://lmcs.episciences.org/3245/pdf