Superhighness

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 $K$-trivial sets.

References in corpus (2)

• On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
• Superhighness

Cited by in corpus (1)

• Superhighness