scientific article
From MaRDI portal
Publication:3789545
zbMath0646.03039MaRDI QIDQ3789545
Publication date: 1988
Full work available at URL: https://eudml.org/doc/17629
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
recursion theoryconstructive measure theorytt-reducibilityT-reducibilityarithmetization of Lebesgue measurability of sets of realsB- measurabilityconstructive function of a real variable
Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Other constructive mathematics (03F65) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Demuth’s Path to Randomness ⋮ Randomness notions and partial relativization ⋮ STRONG JUMP-TRACEABILITY ⋮ Continuous randomness via transformations of 2-random sequences ⋮ Demuth randomness and computational complexity ⋮ Computably enumerable sets below random sets ⋮ ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY ⋮ Diagonally non-computable functions and fireworks ⋮ Strong reductions in effective randomness ⋮ Lowness for Demuth Randomness ⋮ Process and truth-table characterisations of randomness ⋮ On the degree spectrum of a $\Pi ^0_1$ class ⋮ Difference randomness ⋮ Measure-theoretic applications of higher Demuth’s Theorem ⋮ Effective randomness for continuous measures
