Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences

DOI10.1093/COMJNL/42.4.294MaRDI QIDQ4933949zbMATH OpenOpenAlexFDO

Authors Vladimir V. V'yugin

Publication date 17 January 2000

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/a6fd38ec92e9ecf94e2b36328cebfa034f28f075

zbMATH Keywords

Kolmogorov complexityprefix complexityresource-bounded complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 107774
• scientific article; zbMATH DE number 4143127
• Statistical properties of finite sequences with high Kolmogorov complexity
• The complexity of stochastic sequences
• scientific article; zbMATH DE number 3890728

Cited in

(22)

• Nonstochastic estimates
• Does snooping help?
• Concentration theorems for entropy and free energy
• Algorithmic statistics: forty years later
• scientific article; zbMATH DE number 3860059 (Why is no real title available?)
• scientific article; zbMATH DE number 4135865 (Why is no real title available?)
• scientific article; zbMATH DE number 4143127 (Why is no real title available?)
• scientific article; zbMATH DE number 3917706 (Why is no real title available?)
• scientific article; zbMATH DE number 3942590 (Why is no real title available?)
• scientific article; zbMATH DE number 2066908 (Why is no real title available?)
• Complexity of families of learning algorithms and estimation of the nonrandomness of extraction of empirical regularities
• Generating binary sequences for stochastic computing
• Non-Algorithmic Theory of Randomness
• On the algorithmic complexity of static structures
• The Kolmogorov birthday paradox
• Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics)
• On the lifetime of a random binary sequence
• Algebraic barriers to halving algorithmic information quantities in correlated strings
• Kolmogorov complexity in the USSR (1975--1982): isolation and its end
• An empirical study of the complexity and randomness of prediction error sequences
• Sophistication revisited
• Information measures for infinite sequences

This page was built for publication: Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933949)