Constraints placed on random sequences by their compressibility
type: Item
instance of: scholarly article
title: Constraints placed on random sequences by their compressibility
zbMATH Open document ID: 1256.03046
author: George Davie
published in: Statistics \& Probability Letters
publication date: 2012-08-30T00:00:00Z
Mathematics Subject Classification ID: 03D32
Mathematics Subject Classification ID: 60A05
Mathematics Subject Classification ID: 60F10
Mathematics Subject Classification ID: 60G50
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 6074591
zbMATH Keywords: algorithmically random sequence
zbMATH Keywords: compressibility
zbMATH Keywords: probability laws
zbMATH Keywords: large deviations
MaRDI profile type: Publication
full work available at URL: j.spl.2012.04.009
OpenAlex ID: W1980120528
cites work: New applications of the incompressibility method. II
cites work: A Theory of Program Size Formally Identical to Information Theory
cites work: A computable version of the random signs problem and Kolmogorov complexity
cites work: The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity
cites work: Algorithmic Randomness and Complexity
cites work: Q5538132
cites work: Uniform test of algorithmic randomness over a general space
cites work: An Application of Martin-Löf Randomness to Effective Probability Theory
cites work: Applications of Effective Probability Theory to Martin-Löf Randomness
cites work: Q3214803
cites work: An introduction to Kolmogorov complexity and its applications
cites work: The definition of random sequences
cites work: Computability and Randomness
cites work: A formal theory of inductive inference. Part I
cites work: The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
DOI: 10.1016/J.SPL.2012.04.009
description: scientific article; zbMATH DE number 6074591