When does randomness come from randomness?
From MaRDI portal
Publication:287436
DOI10.1016/j.tcs.2016.05.001zbMath1339.68127arXiv1508.05082OpenAlexW2962835668MaRDI QIDQ287436
Publication date: 26 May 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.05082
computable analysisalgorithmic randomnessSchnorr randomnesscomputable randomnessno randomness ex nihilono randomness from nothingrandomness conservationrandomness preservationrecursive randomness
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)
Related Items (3)
Schnorr randomness for noncomputable measures ⋮ Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness ⋮ Computable Measure Theory and Algorithmic Randomness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomness on computable probability spaces -- a dynamical point of view
- On a definition of random sequences with respect to conditional probability
- On the relation between descriptional complexity and algorithmic probability
- Mathematical metaphysics of randomness
- The descriptive complexity of Brownian motion
- Strong reductions in effective randomness
- Randomness and semimeasures
- A universal pair of 1/2-betting strategies
- Cone avoidance and randomness preservation
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Some results on effective randomness
- Algorithmic tests and randomness with respect to a class of measures
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Computable randomness and betting for computable probability spaces
- L1-Computability, Layerwise Computability and Solovay Reducibility
- Schnorr randomness and the Lebesgue differentiation theorem
- On zeros of Martin-Löf random Brownian motion
- Truth-table Schnorr randomness and truth-table reducible randomness
- Difference randomness
- The probability distribution as a computational resource for randomness testing
- Algorithmic Randomness and Complexity
- Schnorr trivial sets and truth-table reducibility
- An Application of Martin-Löf Randomness to Effective Probability Theory
- Applications of Effective Probability Theory to Martin-Löf Randomness
- Randomness conservation inequalities; information and independence in mathematical theories
- The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
- A unified approach to the definition of random sequences
- The definition of random sequences
- ∏ 0 1 Classes and Degrees of Theories
- Van Lambalgen's theorem for uniformly relative Schnorr and computable randomness
This page was built for publication: When does randomness come from randomness?
