Premium
Strong jump‐traceability and Demuth randomness
Author(s) -
Greenberg Noam,
Turetsky Daniel D.
Publication year - 2014
Publication title -
proceedings of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.899
H-Index - 65
eISSN - 1460-244X
pISSN - 0024-6115
DOI - 10.1112/plms/pdt040
Subject(s) - randomness , mathematics , jump , class (philosophy) , set (abstract data type) , subclass , discrete mathematics , artificial intelligence , computer science , statistics , physics , quantum mechanics , antibody , immunology , biology , programming language
We solve the covering problem for Demuth randomness, showing that a computably enumerable set is computable from a Demuth random set if and only if it is strongly jump‐traceable. We show that, on the other hand, the class of sets that form a base for Demuth randomness is a proper subclass of the class of strongly jump‐traceable sets.