Skip to search formSkip to main contentSkip to account menu

Algorithmically random sequence

Known as: Martin-Löf randomness, Algorithmically random, Martin-Loef random 
Intuitively, an algorithmically random sequence (or random sequence) is an infinite sequence of binary digits that appears random to any algorithm… 
Wikipedia (opens in a new tab)

Related topics

Related topics

23 relations
Algorithmic information theoryArithmetical hierarchyChaitin's constantChurch–Turing thesis

Broader (1)

Randomness

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Granularity of wagers in games and the (im)possibility of savings
In a casino where arbitrarily small bets are admissible, any betting strategy $M$ can be modified into a savings strategy that… 
2017
2017
Algorithmic randomness and analysis
In this thesis we study the interaction between algorithmic randomness and mathematical analysis. In particular, we focus on the… 
2016
2016
ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS
Abstract In this article, I consider the status of several statements analogous to the Church–Turing thesis that assert that some… 
2015
2015
An operational characterization of the notion of probability by algorithmic randomness and its applications (Proof Theory, Computation Theory and Related Topics)
2012
2012
Computability, Complexity and Randomness
2011
2011
On Instability of the Ergodic Limit Theorems with Respect to Small Violations of Algorithmic Randomness
An instability property of the Birkhoff's ergodic the- orem and related asymptotic laws with respect to small violations of… 
2009
2009
Some problems of algorithmic randomness on product space (The 8th Workshop on Stochastic Numerics)
2006
2006
The quantum measurement problem and physical reality: a computation theoretic perspective
Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits… 
2003
2003
Independence Properties of Algorithmically Random Sequences
A bounded Kolmogorov-Loveland selection rule is an adaptive strategy for recursively selecting a subsequence of an infinite… 
1996
1996
Spectral quantities associated to pairs of matrices are hard, when not impossible, to compute and to approximate
Spectral quantities associated to pairs of matrices are hard-when not impossible-to compute and to approximate* Abstract We… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)