Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,680,333 papers from all fields of science
Search
Sign In
Create Free Account
Algorithmically random sequence
Known as:
Martin-Löf randomness
, Algorithmically random
, Martin-Loef random
Expand
Intuitively, an algorithmically random sequence (or random sequence) is an infinite sequence of binary digits that appears random to any algorithm…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Algorithmic information theory
Arithmetical hierarchy
Chaitin's constant
Church–Turing thesis
Expand
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
George Barmpalias
,
Nan Fang
arXiv.org
2018
Corpus ID: 52979196
In a casino where arbitrarily small bets are admissible, any betting strategy $M$ can be modified into a savings strategy that…
Expand
2017
2017
Coherence of Reducibilities with Randomness Notions
Kenshi Miyabe
Theory of Computing Systems
2017
Corpus ID: 253745182
Loosely speaking, when A is “more random” than B and B is “random”, then A should be random. The theory of algorithmic randomness…
Expand
2016
2016
ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS
Christopher P. Porter
The Review of Symbolic Logic
2016
Corpus ID: 16249836
Abstract In this article, I consider the status of several statements analogous to the Church–Turing thesis that assert that some…
Expand
2015
2015
An operational characterization of the notion of probability by algorithmic randomness and its applications (Proof Theory, Computation Theory and Related Topics)
只木 孝太郎
2015
Corpus ID: 117562644
2012
2012
Computability, Complexity and Randomness
R. Downey
Theory of Computing Systems
2012
Corpus ID: 253742001
2011
2011
On Instability of the Ergodic Limit Theorems with Respect to Small Violations of Algorithmic Randomness
Bol ' shoi
2011
Corpus ID: 123689549
An instability property of the Birkhoff's ergodic the- orem and related asymptotic laws with respect to small violations of…
Expand
2006
2006
The quantum measurement problem and physical reality: a computation theoretic perspective
R. Srikanth
arXiv.org
2006
Corpus ID: 11910306
Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits…
Expand
2006
2006
Similarity Searching in DNA Sequences by Spectral Distortion Measures
Tuan D. Pham
Industrial Conference on Data Mining
2006
Corpus ID: 30198932
Searching for similarity among biological sequences is an important research area of bioinformatics because it can provide…
Expand
2003
2003
Independence Properties of Algorithmically Random Sequences
Steven M. Kautz
arXiv.org
2003
Corpus ID: 14707571
A bounded Kolmogorov-Loveland selection rule is an adaptive strategy for recursively selecting a subsequence of an infinite…
Expand
1996
1996
Spectral quantities associated to pairs of matrices are hard, when not impossible, to compute and to approximate
J. Tsitsiklis
,
V. Blondel
,
Decision Systems.
1996
Corpus ID: 15260712
Spectral quantities associated to pairs of matrices are hard-when not impossible-to compute and to approximate* Abstract We…
Expand