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...
| Main Authors: | , , |
|---|---|
| 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 |
| _version_ | 1797268577042038784 |
|---|---|
| author | Arno Pauly Willem Fouché George Davie |
| author_facet | Arno Pauly Willem Fouché George Davie |
| author_sort | Arno Pauly |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-25T01:34:41Z |
| format | Article |
| id | doaj.art-9c4eec6163d042788a966a5156b2b795 |
| institution | Directory Open Access Journal |
| issn | 1860-5974 |
| language | English |
| last_indexed | 2024-04-25T01:34:41Z |
| publishDate | 2018-05-01 |
| publisher | Logical Methods in Computer Science e.V. |
| record_format | Article |
| series | Logical Methods in Computer Science |
| spelling | doaj.art-9c4eec6163d042788a966a5156b2b7952024-03-08T09:59:19ZengLogical Methods in Computer Science e.V.Logical Methods in Computer Science1860-59742018-05-01Volume 14, Issue 210.23638/LMCS-14(2:11)20183245Weihrauch-completeness for layerwise computabilityArno PaulyWillem FouchéGeorge DavieWe 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://lmcs.episciences.org/3245/pdfcomputer science - logic in computer science |
| spellingShingle | Arno Pauly Willem Fouché George Davie Weihrauch-completeness for layerwise computability Logical Methods in Computer Science computer science - logic in computer science |
| title | Weihrauch-completeness for layerwise computability |
| title_full | Weihrauch-completeness for layerwise computability |
| title_fullStr | Weihrauch-completeness for layerwise computability |
| title_full_unstemmed | Weihrauch-completeness for layerwise computability |
| title_short | Weihrauch-completeness for layerwise computability |
| title_sort | weihrauch completeness for layerwise computability |
| topic | computer science - logic in computer science |
| url | https://lmcs.episciences.org/3245/pdf |
| work_keys_str_mv | AT arnopauly weihrauchcompletenessforlayerwisecomputability AT willemfouche weihrauchcompletenessforlayerwisecomputability AT georgedavie weihrauchcompletenessforlayerwisecomputability |