55 citations · 164 across the 24 of their papers we have counts for
31 papers
Computably totally disconnected locally compact groups
Alexander Melnikov, Andre Nies
We study totally disconnected, locally compact (t.d.l.c.) groups from an algorithmic perspective. We give various approaches to defining computable presentations of t.d.l.c.\ group…
From eventually different functions to pandemic numberings
Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen +1
A function is strongly non-recursive (SNR) if it is eventually different from each recursive function. We obtain hierarchy results for the mass problems associated with computing s…
Highness properties close to PA-completeness
Noam Greenberg, Joseph S. Miller, Andre Nies
Suppose we are given a computably enumerable object arise from algorithmic randomness or computable analysis. We are interested in the strength of oracles which can compute an obje…
Coarse groups, and the isomorphism problem for oligomorphic groups
Andre Nies, Philipp Schlicht, Katrin Tent
Let denote the topological group of permutations of the natural numbers. We study the complexity of the isomorphism relation on classes of closed subgroups in…
Randomness and initial segment complexity for probability measures
Andre Nies, Frank Stephan
We study algorithmic randomness properties for probability measures on Cantor space. We say that a measure on the space of infinite bit sequences is ML absolutely continuous if…
Fraïssé Limits for Relational Metric Structures
David Bryant, André Nies, Paul Tupper
The general theory developed by Ben Yaacov for metric structures provides Fraïssé limits which are approximately ultrahomogeneous. We show here that this result can be strengthened…