Superhighness
Logic
2014-08-14 v1
Abstract
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 class superhigh, and show that it contains some, but not all, of the noncomputable -trivial sets.
Cite
@article{arxiv.1408.2845,
title = {Superhighness},
author = {André Nies and Bjørn Kjos-Hanssen},
journal= {arXiv preprint arXiv:1408.2845},
year = {2014}
}