scientific article; zbMATH DE number 4053595

MaRDI QIDQ3789545zbMATH OpenFDO

Authors Oswald Demuth

Publication date 1988

Full work available at URL https://eudml.org/doc/17629

zbMATH Keywords

recursion theoryconstructive measure theorytt-reducibilityT-reducibilityarithmetization of Lebesgue measurability of sets of realsB- measurabilityconstructive function of a real variable

Mathematics Subject Classification ID

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)

Recommendations

• Arithmetical Measure
• scientific article; zbMATH DE number 761273
• scientific article; zbMATH DE number 218531
• Limit computability and constructive measure
• Measure-theoretic applications of higher Demuth's theorem

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
• scientific article; zbMATH DE number 218531 (Why is no real title available?)
• 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)