Kolmogorov-Loveland stochasticity for finite strings

DOI10.1016/J.IPL.2004.05.014zbMath1177.60008OpenAlexW2002313798MaRDI QIDQ2390324

Bruno Durand, Nikolai K. Vereshchagin

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.05.014

zbMATH Keywords

algorithmsfinite stringKolmogorov-Loveland selection

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Foundations of probability theory (60A99)

Related Items (2)

Kolmogorov-Loveland stochasticity and Kolmogorov complexity ⋮ An empirical study of the complexity and randomness of prediction error sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Mathematical metaphysics of randomness
• On tables of random numbers
• Process complexity and effective random tests
• Some Properties of Kolmogorov $\Delta$-Random Finite Sequences
• The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
• The definition of random sequences

This page was built for publication: Kolmogorov-Loveland stochasticity for finite strings