scientific article; zbMATH DE number 1107583

zbMATH Open0889.94001MaRDI QIDQ4373515

Author name not available (Why is that?)

Publication date: 21 January 1998

Title of this publication is not available (Why is that?)

zbMATH Keywords

algorithmic information theoryKolmogorov complexityKolmogorov entropySinai entropy

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Measures of information, entropy (94A17) Statistical aspects of information-theoretic topics (62B10)

Related Items (5)

Amplification of One-Way Information Complexity via Codes and Noise Sensitivity ⋮ Information-theoretic lower bound on energy cost of stochastic computation ⋮ Stochastic accumulation of information in discrete time: Comparing exact results and Wald approximations ⋮ Chaitin complexity, Shannon information content of a single event, and infinite random sequences. II ⋮ Shannon Entropy vs. Kolmogorov Complexity

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 Q4373515)