Arno Pauly | DeepAI

DeepAI AI Chat

Featured Co-authors

Jean-François Raskin
38 publications
Mickael Randour
17 publications
Stephane Le Roux
14 publications
Martin Ziegler
12 publications
Takayuki Kihara
11 publications
Adeline Paiement
9 publications
Marie Van den Bogaard
9 publications
Bakh Khoussainov
8 publications
Ismaël Jecker
5 publications
Matthew de Brecht
5 publications
Nicolas Basset
4 publications

∙ 05/01/2023

Embeddability of graphs and Weihrauch degrees

We study the complexity of the following related computational tasks con...

0 Vittorio Cipriani, et al. ∙

∙ 01/07/2023

On the Weihrauch degree of the additive Ramsey theorem

We characterize the strength, in terms of Weihrauch degrees, of certain ...

0 Arno Pauly, et al. ∙

∙ 09/02/2021

The Weihrauch degree of finding Nash equilibria in multiplayer games

Is there an algorithm that takes a game in normal form as input, and out...

0 Tonicha Crook, et al. ∙

∙ 02/12/2021

A Computability Perspective on (Verified) Machine Learning

There is a strong consensus that combining the versatility of machine le...

0 Tonicha Crook, et al. ∙

∙ 01/22/2021

Adaptive Neighbourhoods for the Discovery of Adversarial Examples

Deep Neural Networks (DNNs) have often supplied state-of-the-art results...

0 Jay Morgan, et al. ∙

∙ 10/08/2020

Finding descending sequences through ill-founded linear orders

In this work we investigate the Weihrauch degree of the problem 𝖣𝖲 of fi...

0 Jun Le Goh, et al. ∙

∙ 08/25/2020

An update on Weihrauch complexity, and some open questions

This is an informal survey of progress in Weihrauch complexity (cf arXiv...

0 Arno Pauly, et al. ∙

∙ 06/28/2019

Computing Haar Measures

According to Haar's Theorem, every compact group G admits a unique left-...

0 Arno Pauly, et al. ∙

∙ 05/02/2019

Convex choice, finite choice and sorting

We study the Weihrauch degrees of closed choice for finite sets, closed ...

0 Takayuki Kihara, et al. ∙

∙ 04/08/2019

Enumeration degrees and non-metrizable topology

The enumeration degrees of sets of natural numbers can be identified wit...

0 Takayuki Kihara, et al. ∙

∙ 03/13/2019

Effective local compactness and the hyperspace of located sets

We revisit the definition of effective local compactness, and propose an...

0 Arno Pauly, et al. ∙

∙ 03/02/2019

Computability Aspects of Differential Games in Euclidian Spaces

We study computability-theoretic aspects of differential games. Our focu...

0 Gafurjan Ibragimov, et al. ∙

∙ 02/14/2019

Overt choice

We introduce and study the notion of overt choice for countably-based sp...

0 Matthew de Brecht, et al. ∙

∙ 12/04/2018

Searching for an analogue of ATR in the Weihrauch lattice

There are close similarities between the Weihrauch lattice and the zoo o...

0 Takayuki Kihara, et al. ∙

∙ 09/10/2018

Parameterized Games and Parameterized Automata

We introduce a way to parameterize automata and games on finite graphs w...

0 Arno Pauly, et al. ∙

∙ 08/17/2018

Extending finite-memory determinacy by Boolean combination of winning conditions

We study finite-memory (FM) determinacy in games on finite graphs, a cen...

0 Stephane Le Roux, et al. ∙

∙ 05/29/2018

Beyond admissibility: Dominance between chains of strategies

Admissible strategies, i.e. those that are not dominated by any other st...

0 Nicolas Basset, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world