A minimal pair of 𝐾-degrees
From MaRDI portal
Publication:3372137
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)
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Universal computably enumerable sets and initial segment prefix-free complexity, Solovay functions and their applications in algorithmic randomness, On the number of infinite sequences with trivial initial segment complexity, Kolmogorov complexity of initial segments of sequences and arithmetical definability, On the gap between trivial and nontrivial initial segment prefix-free complexity, Depth, Highness and DNR Degrees
Cites Work