EXACT PAIRS FOR THE IDEAL OF THEK-TRIVIAL SEQUENCES IN THE TURING DEGREES

DOI10.1017/jsl.2014.37zbMath1353.03041OpenAlexW1991171089MaRDI QIDQ2933669

George Barmpalias, Rodney G. Downey

Publication date: 5 December 2014

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jsl.2014.37

zbMATH Keywords

Kolmogorov complexityTuring degreescomputably enumerable\(K\)-trivial setsexact pairs

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25) Algorithmic randomness and dimension (03D32)

Related Items (1)

Computing from projections of random points

Cites Work

• Algorithmic Randomness and Complexity
• Unnamed Item

This page was built for publication: EXACT PAIRS FOR THE IDEAL OF THEK-TRIVIAL SEQUENCES IN THE TURING DEGREES