Uniform test of algorithmic randomness over a general space

DOI10.1016/j.tcs.2005.03.054zbMath1077.68038OpenAlexW1967782843MaRDI QIDQ2566004

Publication date: 22 September 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.054

zbMATH Keywords

Bernoulli distributions Levin's theory

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items

Computability of convergence rates in the ergodic theorem for Martin-Löf random points, 2011 North American Annual Meeting of the Association for Symbolic Logic, UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS, Non-Algorithmic Theory of Randomness, Computability of probability measures and Martin-Löf randomness over metric spaces, Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy, Schnorr randomness for noncomputable measures, Bayesian definition of random sequences with respect to conditional probabilities, On computability and disintegration, Effective weak and vague convergence of measures on the real line, A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points, Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács, Confidence and discoveries with \(e\)-values, COMPUTABLY COMPACT METRIC SPACES, Characterization of Kurtz randomness by a differentiation theorem, Notes on sum-tests and independence tests, Constraints placed on random sequences by their compressibility, Prequential Randomness, Supermartingales in Prediction with Expert Advice, Independence, relative randomness, and PA degrees, How much randomness is needed for statistics?, Algorithmic identification of probabilities is hard, On the computability of a construction of Brownian motion, Effectively closed sets of measures and randomness, Notions of Probabilistic Computability on Represented Spaces, An Application of Martin-Löf Randomness to Effective Probability Theory, Algorithmic randomness over general spaces, Randomness on computable probability spaces -- a dynamical point of view, Kolmogorov complexity and the geometry of Brownian motion, Prequential randomness and probability, Supermartingales in prediction with expert advice, Equivalences between learning of data and probability distributions, and their applications, Characterizing the continuous degrees, Effective Hausdorff dimension in general metric spaces, Microscopic reversibility and macroscopic irreversibility: from the viewpoint of algorithmic randomness, Algorithmic tests and randomness with respect to a class of measures, An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages, A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties, A computable approach to measure and integration theory, Randomness and the Ergodic Decomposition, Computability of the Radon-Nikodym Derivative, Computable randomness and betting for computable probability spaces, Randomness for non-computable measures, Measures and their random reals, Effective symbolic dynamics, random points, statistical behavior, complexity and entropy, Effective randomness for continuous measures, Cone avoidance and randomness preservation, Probabilistic computability and choice, Computable Measure Theory and Algorithmic Randomness, Effective notions of weak convergence of measures on the real line

Cites Work