101 citations · 491 across the 53 of their papers we have counts for
4 papers · 1 filter
Finding descending sequences through ill-founded linear orders
Jun Le Goh, Arno Pauly, Manlio Valenti
In this work we investigate the Weihrauch degree of the problem of finding an infinite descending sequence through a given ill-founded linear order, which is shared b…
An update on Weihrauch complexity, and some open questions
Arno Pauly
This is an informal survey of progress in Weihrauch complexity (cf arXiv:1707.03202) in the period 2018-2020. Open questions are emphasised.
Luzin's (N) and randomness reflection
Arno Pauly, Linda Westrick, Liang Yu
We show that a computable function has Luzin's property (N) if and only if it reflects -randomnes, if and only if it reflects $Δ^1_1(\mathc…
The open and clopen Ramsey theorems in the Weihrauch lattice
Alberto Marcone, Manlio Valenti
We investigate the uniform computational content of the open and clopen Ramsey theorems in the Weihrauch lattice. While they are known to be equivalent to from the…