منابع مشابه
Prequential Randomness
This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincide. One notion is the prequential version of the standard definition due to Martin-Löf, and the other is the prequential version of the martingale definition of randomness due to Schnorr. This is another manifestation of...
متن کاملPrequential probability: game-theoretic = measure theoretic
This article continues study of the prequential framework for evaluating a probability forecaster. Testing the hypothesis that the sequence of forecasts issued by the forecaster is in agreement with the observed outcomes can be done using prequential notions of probability. It turns out that there are two natural notions of probability in the prequential framework: game-theoretic, whose idea go...
متن کاملProbability and Randomness
Random outcomes, in ordinary parlance, are those that occur haphazardly, unpredictably, or by chance. Even without further clarification, these glosses suggest an interesting connection between randomness and probability, in some of its guises. But we need to be more precise to articulate the relationship between the two subjects of our title. There is a large literature distinguishing kinds an...
متن کاملProbability Measures and Effective Randomness
We study the question, “For which reals x does there exist a measure μ such that x is random relative to μ?” We show that for every nonrecursive x, there is a measure which makes x random without concentrating on x. We give several conditions on x equivalent to there being continuous measure which makes x random. We show that for all but countably many reals x these conditions apply, so there i...
متن کاملProbability, algorithmic complexity, and subjective randomness
We present a statistical account of human randomness judgments that uses the idea of algorithmic complexity. We show that an existing measure of the randomness of a sequence corresponds to the assumption that non-random sequences are generated by a particular probabilistic finite state automaton, and use this as the basis for an account that evaluates randomness in terms of the length of progra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.04.002