A minimal pair of 𝐾-degrees

DOI10.1090/S0002-9939-05-08086-XzbMath1147.03025MaRDI QIDQ3372137

Antonio Montalbán, Barbara F. Csima

Publication date: 17 February 2006

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (6)

Universal computably enumerable sets and initial segment prefix-free complexity ⋮ Depth, Highness and DNR Degrees ⋮ On the gap between trivial and nontrivial initial segment prefix-free complexity ⋮ On the number of infinite sequences with trivial initial segment complexity ⋮ Solovay functions and their applications in algorithmic randomness ⋮ Kolmogorov complexity of initial segments of sequences and arithmetical definability

Cites Work

• Randomness and reducibility
• The Kolmogorov complexity of random reals
• Algorithmic Randomness and Complexity
• Calibrating Randomness
• Unnamed Item
• Unnamed Item

This page was built for publication: A minimal pair of 𝐾-degrees