The Intersection of Algorithmically Random Closed Sets and Effective Dimension
Abstract
References
Index Terms
- The Intersection of Algorithmically Random Closed Sets and Effective Dimension
Recommendations
Members of Random Closed Sets
CiE '09: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational PracticeThe 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 $\frac{2}{3}$. To be such a member, a sufficient ...
Random closed sets
CiE'06: Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational BarriersWe 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. Π02 random closed sets exist but ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
- Refereed
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 62Total Downloads
- Downloads (Last 12 months)13
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderFull Text
View this article in Full Text.
Full TextHTML Format
View this article in HTML Format.
HTML Format