9 citations · 15 across the 9 of their papers we have counts for
Showing 2016 · math.LOShow all
2 papers · 2 filters
math.LO2016
Calibrating word problems of groups via the complexity of equivalence relations
André Nies, Andrea Sorbi
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable…
math.LO2016
Lowness, randomness, and computable analysis
André Nies
Analytic concepts contribute to our understanding of randomness of reals via algorithmic tests. They also influence the interplay between randomness and lowness notions. We provide…