Weihrauch-completeness for layerwise computability

Arno Pauly; Willem Fouché; George Davie

doi:10.23638/LMCS-14(2:11)2018

Arno Pauly ; Willem Fouché ; George Davie - Weihrauch-completeness for layerwise computability

lmcs:3245 - Logical Methods in Computer Science, May 22, 2018, Volume 14, Issue 2 - https://doi.org/10.23638/LMCS-14(2:11)2018

Weihrauch-completeness for layerwise computabilityArticle

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

https://doi.org/10.23638/LMCS-14(2:11)2018

Source: arXiv.org:1505.02091

Volume: Volume 14, Issue 2

Published on: May 22, 2018

Accepted on: April 9, 2018

Submitted on: April 5, 2017

Keywords: Computer Science - Logic in Computer Science

Licence: Attribution 4.0 International (CC BY 4.0)

Funding:

Source : OpenAIRE Graph