Sciweavers

627 search results - page 1 / 126
» Kolmogorov-Loveland Randomness and Stochasticity
Sort
View
STACS
2005
Springer
13 years 11 months ago
Kolmogorov-Loveland Randomness and Stochasticity
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
Wolfgang Merkle, Joseph S. Miller, André Ni...
STACS
2007
Springer
14 years 5 days ago
Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity
Abstract. Merkle et al. [13] showed that all Kolmogorov-Loveland stochas
Laurent Bienvenu
TCS
2010
13 years 4 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 And...
Bart Kastermans, Steffen Lempp
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
13 years 10 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
CORR
2011
Springer
151views Education» more  CORR 2011»
13 years 1 months ago
Generating Probability Distributions using Multivalued Stochastic Relay Circuits
— The problem of random number generation dates
David Lee, Jehoshua Bruck