Journal article 1245 views 98 downloads
Weihrauch-completeness for layerwise computability
,
Willem Fouche,
George Davie
Logical Methods in Computer Science, Volume: 14, Issue: 2
Swansea University Author:
Arno Pauly
-
PDF | Version of Record
Released under the terms of a Creative Commons Attribution License (CC-BY).
Download (458.04KB)
DOI (Published version): 10.23638/LMCS-14(2:11)2018
Abstract
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...
| Published in: | Logical Methods in Computer Science |
|---|---|
| Published: |
2018
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa39359 |
| Abstract: |
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. |
|---|---|
| Keywords: |
Weihrauch reducibility, randomness, layerwise computability, computable analysis |
| College: |
Faculty of Science and Engineering |
| Issue: |
2 |