Von Mises' definition of random sequences reconsidered
From MaRDI portal
Publication:3764938
DOI10.2307/2274360zbMATH Open0628.60001OpenAlexW4242145395MaRDI QIDQ3764938FDOQ3764938
Authors: Michiel van Lambalgen 
Publication date: 1987
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274360
Recommendations
- On a definition of random sequences with respect to conditional probability
- Remarks on "Random Sequences"
- scientific article; zbMATH DE number 3895049
- scientific article; zbMATH DE number 270263
- On irregularity theorems for random sequences
- Random sequences in generalized Cantor sets
- On mixing sequences of random variables
- scientific article; zbMATH DE number 3909434
- Random sequences in Fréchet spaces
Cited In (65)
- Towards unique physically meaningful definitions of random and typical objects
- A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
- Bayesian definition of random sequences with respect to conditional probabilities
- Martingales in the Study of Randomness
- Computable Bayesian compression for uniformly discretizable statistical models
- Finite-state relative dimension, dimensions of AP subsequences and a finite-state van Lambalgen's theorem
- Projection theorems using effective dimension
- Dimension spectra of random subfractals of self-similar fractals
- Thinking with notations: epistemic actions and epistemic activities in mathematical practice
- The random members of a \({\Pi }_{1}^{0}\) class
- Kolmogorov-Loveland stochasticity and Kolmogorov complexity
- Identifying randomness given by high descriptive complexity
- Can an individual sequence of zeros and ones be random?
- A comparative study of some pseudorandom number generators
- On Kurtz randomness
- Recursive computational depth
- Microscopic reversibility and macroscopic irreversibility: from the viewpoint of algorithmic randomness
- Recursive computational depth.
- Title not available (Why is that?)
- On generalized computable universal priors and their convergence
- On effectively closed sets of effective strong measure zero
- A separation of two randomness concepts
- Randomness and reducibility
- The Kolmogorov complexity of random reals
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
- Things that can be made into themselves
- Structures of some strong reducibilities
- The dimensions of individual strings and sequences
- Algorithmic complexity of points in dynamical systems
- On a definition of random sequences with respect to conditional probability
- Algorithmic randomness and splitting of supermartingales
- Title not available (Why is that?)
- Simple betting and stochasticity
- Almost everywhere high nonuniform complexity
- Universality probability of a prefix-free machine
- The descriptive complexity of Brownian motion
- The Kolmogorov complexity of infinite words
- Title not available (Why is that?)
- Computable Measure Theory and Algorithmic Randomness
- Dynamics of a generic Brownian motion: Recursive aspects
- Coherence of reducibilities with randomness notions
- Finite-state independence
- Ergodic theorems and converses for PSPACE functions
- Computability versus exact computability of martingales
- Unified characterizations of lowness properties via Kolmogorov complexity
- Connectivity properties of dimension level sets
- On relative randomness
- Effective randomness of unions and intersections
- Multistep Bayesian strategy in coin-tossing games and its application to asset trading games in continuous time
- Models and the dynamics of theory-building in physics. I: Modeling strategies
- Connectivity properties of dimension level sets
- Feasible reductions to Kolmogorov-Loveland stochastic sequences
- Monotonous betting strategies in warped casinos
- Algorithmic randomness of continuous functions
- Randomness? What randomness?
- When van Lambalgen’s Theorem fails
- The frequency interpretation in probability
- On initial segment complexity and degrees of randomness
- Martin-Löf randomness implies multiple recurrence in effectively closed sets
- Title not available (Why is that?)
- Brudno's theorem for \(\mathbb{Z}^d\) (or \(\mathbb{Z}_+^d\)) subshifts
- Algorithmic randomness and monotone complexity on product space
- Independence, relative randomness, and PA degrees
- Continuous higher randomness
- Relativized Schnorr tests with universal behavior
This page was built for publication: Von Mises' definition of random sequences reconsidered
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3764938)
