Publication:3801539
From MaRDI portal
zbMath0655.03029MaRDI QIDQ3801539
Publication date: 1987
Full work available at URL: https://eudml.org/doc/17515
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
DEGREES OF RANDOMIZED COMPUTABILITY, Closed choice and a uniform low basis theorem, Covering the recursive sets, Randomness for computable measures and initial segment complexity, Demuth randomness and computational complexity, Kolmogorov complexity of initial segments of sequences and arithmetical definability, On effectively closed sets of effective strong measure zero, Measure-theoretic applications of higher Demuth’s Theorem, Demuth’s Path to Randomness, THE TURING DEGREES BELOW GENERICS AND RANDOMS, Genericity and UD-random reals, Weakly Represented Families in Reverse Mathematics, Covering the Recursive Sets