Sciweavers

870 search results - page 1 / 174
» Is It Real, or Is It Randomized
Sort
View
NDJFL
2010
12 years 11 months ago
Subclasses of the Weakly Random Reals
The weakly random reals contain not only the Schnorr random reals as a subclass but also the weakly 1-generic reals and therefore the n-generic reals for every n. While the class o...
Johanna N. Y. Franklin
CORR
2008
Springer
70views Education» more  CORR 2008»
13 years 4 months ago
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
Cristian S. Calude, Nicholas J. Hay
APAL
2007
88views more  APAL 2007»
13 years 5 months ago
Randomness and the linear degrees of computability
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤ β, previously denoted α ≤sw β) then β ≤T α. In fact, every random ...
Andrew E. M. Lewis, George Barmpalias
APAL
2004
84views more  APAL 2004»
13 years 4 months ago
The Kolmogorov complexity of random reals
We investigate the initial segment complexity of random reals. Let K( ) denote pre
Liang Yu, Decheng Ding, Rodney G. Downey
COCOON
2005
Springer
13 years 6 months ago
Solovay Reducibility on D-c.e Real Numbers
A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The...
Robert Rettinger, Xizhong Zheng