On the construction of effective random sets

DOI10.1007/3-540-45687-2_47MaRDI QIDQ4708604zbMATH OpenFDO

Authors Wolfgang Merkle, Nenad Mihailovic

Publication date 18 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2420/24200568.htm

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• On the construction of effectively random sets
• Lowness for the class of random sets
• Computably enumerable sets below random sets
• Autoreducibility of random sets: A sharp bound on the density of guessed bits
• On the Autoreducibility of Random Sequences

Cited in

(12)

• Infinite subsets of random sets of integers
• Two random constructions inside lacunary sets
• Things that can be made into themselves
• Schnorr triviality and its equivalent notions
• Effective bi-immunity and randomness
• On the effective generation of set elements within specified ranges
• On the autoreducibility of random sequences
• Selection by recursively enumerable sets
• The complexity of recursive splittings of random sets
• scientific article; zbMATH DE number 7311154 (Why is no real title available?)
• On the construction of effectively random sets
• Convergence of random series and the rate of convergence of the strong law of large numbers in game-theoretic probability

This page was built for publication: On the construction of effective random sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708604)