scientific article; zbMATH DE number 4053595
zbMATH Open0646.03039MaRDI QIDQ3789545FDOQ3789545
Authors: Oswald Demuth
Publication date: 1988
Full work available at URL: https://eudml.org/doc/17629
Title of this publication is not available (Why is that?)
Recommendations
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) Recursively (computably) enumerable sets and degrees (03D25) Other constructive mathematics (03F65) Other degrees and reducibilities in computability and recursion theory (03D30)
Cited In (16)
- Process and truth-table characterisations of randomness
- Lowness for Demuth Randomness
- Measure-theoretic applications of higher Demuth's theorem
- Continuous randomness via transformations of 2-random sequences
- Demuth's path to randomness
- Computably enumerable sets below random sets
- On the interplay between effective notions of randomness and genericity
- Title not available (Why is that?)
- Strong reductions in effective randomness
- Effective randomness for continuous measures
- Strong jump-traceability
- On the degree spectrum of a \(\Pi ^0_1\) class
- Randomness notions and partial relativization
- Difference randomness
- Demuth randomness and computational complexity
- Diagonally non-computable functions and fireworks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789545)