Can an individual sequence of zeros and ones be random?

DOI10.1070/RM1990v045n01ABEH002321zbMath0702.03038OpenAlexW1979734360WikidataQ57349929 ScholiaQ57349929MaRDI QIDQ3480039

A. L. Semenov, A. Kh. Shen', Vladimir A. Uspensky

Publication date: 1990

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/rm1990v045n01abeh002321

zbMATH Keywords

chaotic sequencesrandom sequencetheory of algorithmsstochastic sequencestypic sequences

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Theory of computing (68Q99) Proof theory and constructive mathematics (03F99)

Related Items (31)

Algorithmic complexity of points in dynamical systems ⋮ Unnamed Item ⋮ Entropy and algorithmic complexity in quantum information theory ⋮ On unstable and unoptimal prediction ⋮ Do stronger definitions of randomness exist? ⋮ Almost periodic sequences. ⋮ Exact constructive and computable dimensions ⋮ Algorithmic randomness and monotone complexity on product space ⋮ On Calibration Error of Randomized Forecasting Algorithms ⋮ Relations between varieties of kolmogorov complexities ⋮ Feasible reductions to Kolmogorov-Loveland stochastic sequences ⋮ Complexity, randomness, discretization: some remarks on a program of J. Ford ⋮ Almost everywhere high nonuniform complexity ⋮ Quantum Algorithmic Complexities and Entropy ⋮ The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences ⋮ On Oscillation-free ε-random Sequences ⋮ RECOGNIZING STRONG RANDOM REALS ⋮ Kolmogorov complexity and cellular automata classification ⋮ An empirical study of the complexity and randomness of prediction error sequences ⋮ Constructing perfect steganographic systems ⋮ Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series ⋮ On a definition of random sequences with respect to conditional probability ⋮ К вопросу о предельном распределении серий в случайной двоичной последовательности ⋮ Vladimir Andreevich Uspensky (27/11/1930–27/6/2018) ⋮ On calibration error of randomized forecasting algorithms ⋮ Mathematical metaphysics of randomness ⋮ Ergodic theorems for individual random sequences ⋮ Non-stochastic infinite and finite sequences ⋮ Algorithmic Information Theory and Foundations of Probability ⋮ Resource bounded randomness and computational complexity ⋮ Kolmogorov-Loveland randomness and stochasticity

This page was built for publication: Can an individual sequence of zeros and ones be random?