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.
2017
2017
Coherence of Reducibilities with Randomness Notions
Loosely speaking, when A is “more random” than B and B is “random”, then A should be random. The theory of algorithmic randomness… 
Review
2017
Review
2017
Liouville, Computable, Borel Normal and Martin-Löf Random Numbers
We survey the relations between four classes of real numbers: Liouville numbers, computable reals, Borel absolutely-normal… 
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… 
2010
2010
Application of Kolmogorov complexity in anomaly detection
Kolmogorov complexity is the basis of algorithmic randomness theory. It quantifies the amount of information of individual object… 
2008
2008
Some fundamental issues concerning degrees of unsolvability
Recall that RT is the upper semilattice of recursively enumerable Turing degrees. We consider two fundamental, classical… 
2008
2008
Wind speed conformal prediction in wind farm based on algorithmic randomness theory
An approach of a mean hourly wind speed conformal prediction in wind farm is proposed. Conformal prediction is a new prediction… 
Review
2008
Review
2008
Law of Excluded Quantum Gambling Strategies
We introduce and analyze a quantum analogue of the Law of Excluded Gambling Strategies of Classical Decision Theory by the… 
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… 
2006
2006
Similarity Searching in DNA Sequences by Spectral Distortion Measures
Searching for similarity among biological sequences is an important research area of bioinformatics because it can provide… 
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)