Strong jump-traceability and Demuth randomness

DOI10.1112/plms/pdt040zbMath1303.03074arXiv1109.6128OpenAlexW1980688886MaRDI 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

zbMATH Keywords

Demuth randomnessstrong jump-traceability

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Related Items (6)

STRONG JUMP-TRACEABILITY ⋮ Characterizing the strongly jump-traceable sets via randomness ⋮ ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ DEMUTH’S PATH TO RANDOMNESS ⋮ Inherent enumerability of strong jump-traceability

This page was built for publication: Strong jump-traceability and Demuth randomness