scientific article; zbMATH DE number 3860059

MaRDI QIDQ3327404zbMATH OpenFDO

Authors A. Kh. Shen'

Publication date 1983

zbMATH Keywords

complexityentropy

Mathematics Subject Classification ID

Foundations of probability theory (60A99) Measures of information, entropy (94A17)

Recommendations

• Nonstochastic estimates
• scientific article; zbMATH DE number 107774
• A note on Kolmogorov complexity and entropy
• scientific article; zbMATH DE number 4143127
• Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences

Cited in

(19)

• Nonstochastic estimates
• Mathematical metaphysics of randomness
• Non-stochastic infinite and finite sequences
• Does snooping help?
• Most sequences are stochastic
• An extended coding theorem with application to quantum complexities
• Occam bound on lowest complexity of elements
• Algorithmic statistics revisited
• Two Problems for Sophistication
• Algorithmic statistics: forty years later
• Kolmogorov Complexity and Model Selection
• An operational characterization of mutual information in algorithmic information theory
• Sophistication vs logical depth
• Algorithmic statistics: normal objects and universal models
• The Kolmogorov birthday paradox
• Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics)
• Algebraic barriers to halving algorithmic information quantities in correlated strings
• Kolmogorov complexity in the USSR (1975--1982): isolation and its end
• Sophistication revisited

This page was built for publication:

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