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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

Loosely speaking, when A is “more random” than B and B is “random”, then A should be random. The theory of algorithmic randomness…

2016

Abstract In this article, I consider the status of several statements analogous to the Church–Turing thesis that assert that some…

2015

We study algorithmically random closed subsets of $\cs$\!, algorithmically random continuous functions from $\cs$ to $\cs$\!, and…

2010

Kolmogorov complexity is the basis of algorithmic randomness theory. It quantifies the amount of information of individual object…

2008

An approach of a mean hourly wind speed conformal prediction in wind farm is proposed. Conformal prediction is a new prediction…

2006

Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits…

2006

Searching for similarity among biological sequences is an important research area of bioinformatics because it can provide…

2001

Many computational problems are algorithmically unsolvable. How well this fundamental assertion of computability theory is based…

1996

Spectral quantities associated to pairs of matrices are hard-when not impossible-to compute and to approximate* Abstract We…

1994

In this paper languages "bounded reducible" to algorithmically random languages are studied; these are the languages whose…