Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Visualization 2001 Conference (Acm
Visualization 2001 Conference (Acm
Computability and Randomness
| Hi-index | 5.23 |
We examine an effective version of the standard fact from analysis which says that, for any @e0 and any Lebesgue-measurable subset of Cantor space, X@?2^@w, there is an open set U"@e@?2^@w,U"@e@?X, such that @m(U"@e)@?@m(X)+@e, where @m(Z) denotes the Lebesgue measure of Z@?2^@w, that arises naturally in the context of algorithmic randomness. More specifically, our main result shows that for any given rational numbers 0@?@e