Abstract
AbstractWe investigate notions of randomness in the space \({\mathcal {C}}[2^{\mathbb {N}}]\) 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. Π0 2 random closed sets exist but there are no random Π0 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^{{\mathbb N}}\) may be defined as the set of infinite paths through a tree and so the problem of compressibility of trees is explored. This leads to some results on a Chaitin-style notion of randomness for closed sets.KeywordsComputabilityRandomnessΠ0 1 Classes
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
