Sciweavers

Share
TCS
2010

Comparing notions of randomness

8 years 11 months ago
Comparing notions of randomness
Abstract. It is an open problem in the area of effective (algorithmic) randomness whether Kolmogorov-Loveland randomness coincides with Martin-L¨of randomness. Joe Miller and Andr´e Nies suggested some variations of Kolmogorov-Loveland randomness to approach this problem and to provide a partial solution. We show that their proposed notion of injective randomness is still weaker than Martin-L¨of randomness. Since in its proof some of the ideas we use are clearer, we also show the weaker theorem that permutation randomness is weaker than Martin-L¨of randomness.
Bart Kastermans, Steffen Lempp
Added 30 Jan 2011
Updated 30 Jan 2011
Type Journal
Year 2010
Where TCS
Authors Bart Kastermans, Steffen Lempp
Comments (0)
books