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