Random closed sets viewed as random recursions
نویسندگان
چکیده
منابع مشابه
Random closed sets viewed as random recursions
It is known that the box dimension of any Martin-Löf random closed set of {0, 1}N is log2( 43 ). Barmpalias et al. [Journal of Logic and Computation, Vol. 17, No. 6 (2007)] gave one method of producing such random closed sets and then computed the box dimension, and posed several questions regarding other methods of construction. We outline a method using random recursive constructions for comp...
متن کاملRandom Closed Sets
We investigate notions of randomness in the space C[2] of nonempty closed subsets of {0, 1}. A probability measure is given and a version of the Martin-Löf Test for randomness is defined. Π 2 random closed sets exist but there are no random Π 1 closed sets. It is shown that a random closed set is perfect, has measure 0, and has no computable elements. A closed subset of 2 may be defined as the ...
متن کاملMembers of Random Closed Sets
The members of Martin-Löf random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-Löf random Galton-Watson trees with survival parameter 2 3 . To be such a member, a sufficient condition is to have effective Hausdorff dimension strictly greater than γ = log2 3 2 , and a necessary condition is to have effective Hausdorff dimension greate...
متن کاملBinary random fields, random closed sets, and morphological sampling
We theoretically formulate the problem of processing continuous-space binary random fields by means of mathematical morphology. This may allow us to employ mathematical morphology to develop new statistical techniques for the analysis of binary random images. Since morphological transformations of continuous-space binary random fields are not measurable in general, we are naturally forced to em...
متن کاملAlgorithmically random closed sets and probability
by Logan M. Axon Algorithmic randomness in the Cantor space, 2 ω , has recently become the subject of intense study. Originally defined in terms of the fair coin measure, algorithmic randomness has since been extended, for example in Reimann and Slaman [22, 23], to more general measures. Others have meanwhile developed definitions of algorithmic randomness for different spaces, for example the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2009
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-009-0126-6