9 citations · 20 across the 9 of their papers we have counts for
9 papers
Logic Blog 2016
Andre Nies
This year's logic blog contains a variety of results, some of them available only here. Highlights include the resolution of the Gamma question by Monin, and a number of entries on…
Calculus of Cost Functions
Andre Nies
Cost functions provide a framework for constructions of sets Turing below the halting problem that are close to computable. We carry out a systematic study of cost functions. We re…
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…
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…
Higher Kurtz randomness
Bjørn Kjos-Hanssen, André Nies, Frank Stephan +1
A real is -Kurtz random (-Kurtz random) if it is in no closed null set ( set). We show that there is a cone of -Kurtz random hyperdegrees. W…
Superhighness
André Nies, Bjørn Kjos-Hanssen
We prove that superhigh sets can be jump traceable, answering a question of Cole and Simpson. On the other hand, we show that such sets cannot be weakly 2-random. We also study the…