Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

CIE
2009
Springer

favoriteEmaildiscussreport

98views Applied Computing» more CIE 2009»

Numberings and Randomness

14 years 1 months ago

Numberings and Randomness

Download www.math.hawaii.edu

Abstract. We prove various results on eﬀective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L¨of random left-computably enumerable reals has a Friedberg numbering, as does the family of all Π0 1 classes of positive measure. On the other hand, the Π0 1 classes contained in the Martin-L¨of random reals do not even have an eﬀective numbering, nor do the left-c.e. reals satisfying a ﬁxed randomness constant. For Π0 1 classes contained in the class of reals satisfying a ﬁxed randomness constant, we prove that at least an eﬀective numbering exists.

Paul Brodhead, Bjørn Kjos-Hanssen

Real-time Traffic

Applied Computing | CIE 2009 | Eﬀective Numbering | Friedberg Numbering | Reals |

claim paper

Related Content

» A True Random Number Generator with Builtin Attack Detection

» Software for uniform random number generation distinguishing the good and the bad

» An Area Time Efficient Field Programmable Mersenne Twister Uniform Random Number Generator

» A pluginbased architecture for random number generation in simulation systems

» Random Number Generation Based on Oscillatory Metastability in Ring Circuits

» A metalevel true random number generator

» Reducing the Cost of Generating APHDistributed Random Numbers

» How to Encrypt with a Malicious Random Number Generator

» Bad and Good Ways of Postprocessing Biased Physical Random Numbers

» Source Codes as Random Number Generators

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	CIE
Authors	Paul Brodhead, Bjørn Kjos-Hanssen

Comments (0)