Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,782,933 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
An Algorithmic Refinement of Maxent Induces a Thermodynamic-like Behaviour in the Reprogrammability of Generative Mechanisms
H. Zenil
,
N. Kiani
,
J. Tegnér
arXiv.org
2018
Corpus ID: 29169814
Reprogramming a generative mechanism to produce a different object is associated with a cost. Here we use the notion of…
Expand
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
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
2013
2013
Liouville Numbers, Borel Normality and Algorithmic Randomness
Cristian S. Calude
,
L. Staiger
2013
Corpus ID: 125042522
2009
2009
Some problems of algorithmic randomness on product space (The 8th Workshop on Stochastic Numerics)
Hayato Takahashi
2009
Corpus ID: 119043328
Review
2008
Review
2008
Law of Excluded Quantum Gambling Strategies
Universitá Di Pavia
,
Italia
2008
Corpus ID: 17884828
We introduce and analyze a quantum analogue of the Law of Excluded Gambling Strategies of Classical Decision Theory by the…
Expand
Review
2006
Review
2006
Tutorial on Mass Problems
S. G. Simpson
2006
Corpus ID: 10489141
Let P be a set of reals viewed as a mass problem, i.e., a “decision problem with more than one solution.” Here the “solutions” of…
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
1994
1994
On Languages Reducible to Algorithmically Random Languages
R. Book
SIAM journal on computing (Print)
1994
Corpus ID: 27716580
In this paper languages "bounded reducible" to algorithmically random languages are studied; these are the languages whose…
Expand