activity
20092023
most citedClosed Choice and a Uniform Low Basis Theorem

101 citations · 491 across the 53 of their papers we have counts for

collaborators
Showing cs.LOShow all

23 papers · 1 filter

cs.LO2021★ 1 cited

The Weihrauch degree of finding Nash equilibria in multiplayer games

Tonicha Crook, Arno Pauly

Is there an algorithm that takes a game in normal form as input, and outputs a Nash equilibrium? If the payoffs are integers, the answer is yes, and lot of work has been done in it…

cs.LO2020

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.

cs.LO2019

Computing Haar Measures

Arno Pauly, Dongseong Seon, Martin Ziegler

According to Haar's Theorem, every compact group admits a unique (regular, right and) left-invariant Borel probability measure . Let the Haar integral (of ) denote the…

cs.LO2019★ 2 cited

Effective local compactness and the hyperspace of located sets

Arno Pauly

We revisit the definition of effective local compactness, and propose an approach that works for arbitrary countably-based spaces extending the previous work on computable metric s…

cs.LO2018★ 4 cited

Searching for an analogue of ATR in the Weihrauch lattice

Takayuki Kihara, Alberto Marcone, Arno Pauly

There are close similarities between the Weihrauch lattice and the zoo of axiom systems in reverse mathematics. Following these similarities has often allowed researchers to transl…

cs.LO2016★ 6 cited

Dividing by zero - how bad is it, really?

Takayuki Kihara, Arno Pauly

In computable analysis testing a real number for being zero is a fundamental example of a non-computable task. This causes problems for division: We cannot ensure that the number w…