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 -
Weihrauch-completeness for layerwise computability

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.

Volume: Volume 14, Issue 2
Published on: May 22, 2018
Accepted on: May 22, 2018
Submitted on: April 5, 2017
Keywords: Computer Science - Logic in Computer Science


Consultation statistics

This page has been seen 645 times.
This article's PDF has been downloaded 398 times.