Superhighness
From MaRDI portal
Publication:987937
DOI10.1215/00294527-2009-020zbMath1204.03041arXiv1408.2845OpenAlexW4236441633MaRDI QIDQ987937
André Nies, Bjørn Kjos-Hanssen
Publication date: 2 September 2010
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2845
Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)
Related Items (3)
Characterizing the strongly jump-traceable sets via randomness ⋮ On arithmetical level of the class of superhigh sets ⋮ Unified characterizations of lowness properties via Kolmogorov complexity
This page was built for publication: Superhighness
