Strong jump-traceability and Demuth randomness
From MaRDI portal
Publication:5411925
DOI10.1112/plms/pdt040zbMath1303.03074arXiv1109.6128MaRDI QIDQ5411925
Noam Greenberg, Daniel D. Turetsky
Publication date: 25 April 2014
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.6128
03D25: Recursively (computably) enumerable sets and degrees
03D28: Other Turing degree structures
03D32: Algorithmic randomness and dimension
Related Items
STRONG JUMP-TRACEABILITY, ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY, Inherent enumerability of strong jump-traceability, Characterizing the strongly jump-traceable sets via randomness, Computability theory. Abstracts from the workshop held January 7--13, 2018, DEMUTH’S PATH TO RANDOMNESS