Pages that link to "Item:Q2510759"

The following pages link to Algorithmic tests and randomness with respect to a class of measures (Q2510759):

Displaying 31 items.

• TT-functionals and Martin-Löf randomness for Bernoulli measures (Q257195) (← links)
• The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite (Q285515) (← links)
• Relating and contrasting plain and prefix Kolmogorov complexity (Q285520) (← links)
• When does randomness come from randomness? (Q287436) (← links)
• A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points (Q418118) (← links)
• Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs (Q494650) (← links)
• How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing (Q935029) (← links)
• Schnorr randomness for noncomputable measures (Q1686119) (← links)
• Conditional probabilities and van Lambalgen's theorem revisited (Q1694006) (← links)
• Layerwise computability and image randomness (Q1694009) (← links)
• Algorithmic identification of probabilities is hard (Q1747492) (← links)
• Randomness deficiencies (Q2011673) (← links)
• On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness (Q2105577) (← links)
• The axiomatic power of Kolmogorov complexity (Q2453066) (← links)
• How much randomness is needed for statistics? (Q2453071) (← links)
• Some results on effective randomness (Q2509038) (← links)
• Uniform test of algorithmic randomness over a general space (Q2566004) (← links)
• The Kučera-Gács theorem revisited by Levin (Q2682931) (← links)
• Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács (Q2686112) (← links)
• Computable randomness and betting for computable probability spaces (Q2827949) (← links)
• Algorithmic Statistics: Forty Years Later (Q2970987) (← links)
• On the concept of the Bernoulli property (Q3025945) (← links)
• Limits to measurement in experiments governed by algorithms (Q3061157) (← links)
• (Q3692863) (← links)
• A test for randomness based on a complexity measure (Q4275809) (← links)
• Computable Measure Theory and Algorithmic Randomness (Q5024573) (← links)
• Randomness Tests: Theory and Practice (Q5049055) (← links)
• A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE (Q5099786) (← links)
• Effective aspects of Bernoulli randomness (Q5212559) (← links)
• Bayesian definition of random sequences with respect to conditional probabilities (Q6044467) (← links)
• Bernoulli randomness and Bernoulli normality (Q6047717) (← links)