Von Mises' definition of random sequences reconsidered
From MaRDI portal
Publication:3764938
DOI10.2307/2274360zbMath0628.60001OpenAlexW4242145395MaRDI QIDQ3764938
Michiel Marian Michiel van Lambalgen
Publication date: 1987
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274360
Related Items (60)
Randomness and reducibility ⋮ Computability versus exact computability of martingales ⋮ On Kurtz randomness ⋮ A separation of two randomness concepts ⋮ The dimensions of individual strings and sequences ⋮ The Kolmogorov complexity of random reals ⋮ Mutual dimension and random sequences ⋮ The Kolmogorov complexity of infinite words ⋮ A comparative study of some pseudorandom number generators ⋮ On generalized computable universal priors and their convergence ⋮ Algorithmic complexity of points in dynamical systems ⋮ Recursive computational depth ⋮ Randomness? What randomness? ⋮ Universality probability of a prefix-free machine ⋮ A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE ⋮ Bayesian definition of random sequences with respect to conditional probabilities ⋮ Dimension spectra of random subfractals of self-similar fractals ⋮ Martingales in the Study of Randomness ⋮ Ergodic theorems and converses for PSPACE functions ⋮ Finite-state relative dimension, dimensions of AP subsequences and a finite-state van Lambalgen's theorem ⋮ On initial segment complexity and degrees of randomness ⋮ Projection theorems using effective dimension ⋮ Algorithmic randomness and monotone complexity on product space ⋮ A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points ⋮ Effective randomness of unions and intersections ⋮ Models and the dynamics of theory-building in physics. I: Modeling strategies ⋮ Connectivity properties of dimension level sets ⋮ Independence, relative randomness, and PA degrees ⋮ Feasible reductions to Kolmogorov-Loveland stochastic sequences ⋮ Algorithmic randomness of continuous functions ⋮ On effectively closed sets of effective strong measure zero ⋮ Almost everywhere high nonuniform complexity ⋮ Brudno's theorem for \(\mathbb{Z}^d\) (or \(\mathbb{Z}_+^d\)) subshifts ⋮ On relative randomness ⋮ Things that can be made into themselves ⋮ Connectivity Properties of Dimension Level Sets ⋮ Structures of Some Strong Reducibilities ⋮ Dynamics of a generic Brownian motion: Recursive aspects ⋮ Kolmogorov-Loveland stochasticity and Kolmogorov complexity ⋮ Multistep Bayesian Strategy in Coin-Tossing Games and Its Application to Asset Trading Games in Continuous Time ⋮ Relativized Schnorr tests with universal behavior ⋮ Finite-state independence ⋮ Coherence of reducibilities with randomness notions ⋮ The random members of a \({\Pi }_{1}^{0}\) class ⋮ Unnamed Item ⋮ Microscopic reversibility and macroscopic irreversibility: from the viewpoint of algorithmic randomness ⋮ On a definition of random sequences with respect to conditional probability ⋮ Algorithmic randomness and splitting of supermartingales ⋮ Monotonous betting strategies in warped casinos ⋮ Computable Bayesian Compression for Uniformly Discretizable Statistical Models ⋮ Martin-Löf randomness implies multiple recurrence in effectively closed sets ⋮ When van Lambalgen’s Theorem fails ⋮ The descriptive complexity of Brownian motion ⋮ Unified characterizations of lowness properties via Kolmogorov complexity ⋮ Recursive computational depth. ⋮ Thinking with notations: epistemic actions and epistemic activities in mathematical practice ⋮ Continuous higher randomness ⋮ Computable Measure Theory and Algorithmic Randomness ⋮ Simple betting and stochasticity ⋮ Identifying randomness given by high descriptive complexity
This page was built for publication: Von Mises' definition of random sequences reconsidered
