Superhighness

DOI10.1215/00294527-2009-020zbMATH Open1204.03041arXiv1408.2845OpenAlexW4236441633MaRDI QIDQ987937FDOQ987937

Authors: Bjørn Kjos-Hanssen, André Nies 

Publication date: 2 September 2010

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

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${}^{D}iamond$, and show that it contains some, but not all, of the noncomputable $K$-trivial sets.

Full work available at URL: https://arxiv.org/abs/1408.2845

Recommendations

• Superhighness and Strong Jump Traceability
• Characterizing the strongly jump-traceable sets via randomness
• A random set which only computes strongly jump-traceable c.e. sets
• Strong jump-traceability. II: \(K\)-triviality
• Strong jump-traceability. I: The computably enumerable case

zbMATH Keywords

jump traceabilitysuperhighness

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Cited In (5)

• Superhighness and Strong Jump Traceability
• On arithmetical level of the class of superhigh sets
• Unified characterizations of lowness properties via Kolmogorov complexity
• Reals which compute little
• Characterizing the strongly jump-traceable sets via randomness

This page was built for publication: Superhighness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987937)