We study the complexity of the following related computational tasks
con...
We characterize the strength, in terms of Weihrauch degrees, of certain
...
Is there an algorithm that takes a game in normal form as input, and out...
There is a strong consensus that combining the versatility of machine
le...
Deep Neural Networks (DNNs) have often supplied state-of-the-art results...
In this work we investigate the Weihrauch degree of the problem 𝖣𝖲
of fi...
This is an informal survey of progress in Weihrauch complexity (cf
arXiv...
According to Haar's Theorem, every compact group G admits a unique
left-...
We study the Weihrauch degrees of closed choice for finite sets, closed
...
The enumeration degrees of sets of natural numbers can be identified wit...
We revisit the definition of effective local compactness, and propose an...
We study computability-theoretic aspects of differential games. Our focu...
We introduce and study the notion of overt choice for countably-based sp...
There are close similarities between the Weihrauch lattice and the zoo o...
We introduce a way to parameterize automata and games on finite graphs w...
We study finite-memory (FM) determinacy in games on finite graphs, a cen...
Admissible strategies, i.e. those that are not dominated by any other
st...