Entropic measures, Markov information sources and complexity

DOI10.1016/S0096-3003(01)00199-0MaRDI QIDQ1855845zbMATH OpenOpenAlexWikidataFDO

Authors Cristian S. Calude, Monica Dumitrescu

Publication date 28 January 2003

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0096-3003(01)00199-0

zbMATH Keywords

algorithmic probabilitycomplexityentropic measuresentropy rateMarkov information sourcesMarkov sourcesShannon's entropy

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27) Statistical aspects of information-theoretic topics (62B10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17)

Review text

This paper, which could be thought of as a review paper, discusses Shannon's entropy and entropy rate for discrete and continuous Markov sources, with finite and continuous alphabets. After a prerequisite on some known results, it examines the relations between program-size complexity, algorithmic probability and entropy of Markov information sources with a binary alphabet and discrete time.

Recommendations

• scientific article; zbMATH DE number 3900670
• A note on Kolmogorov complexity and entropy
• Complexity of strings in the class of Markov sources
• scientific article; zbMATH DE number 4023193
• Entropy and higher moments of information

Cites work

• A Mathematical Theory of Communication
• A proof of the Beyer-Stein-Ulam relation between complexity and entropy
• Algorithmic information and simplicity in statistical physics
• Coding with minimal programs
• Finite Continuous Time Markov Chains
• scientific article; zbMATH DE number 3701980 (Why is no real title available?)
• scientific article; zbMATH DE number 44959 (Why is no real title available?)
• scientific article; zbMATH DE number 53542 (Why is no real title available?)
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3492569 (Why is no real title available?)
• scientific article; zbMATH DE number 3591873 (Why is no real title available?)
• scientific article; zbMATH DE number 1327755 (Why is no real title available?)
• scientific article; zbMATH DE number 736618 (Why is no real title available?)
• scientific article; zbMATH DE number 1009512 (Why is no real title available?)
• scientific article; zbMATH DE number 1390092 (Why is no real title available?)
• scientific article; zbMATH DE number 1418478 (Why is no real title available?)
• scientific article; zbMATH DE number 3085434 (Why is no real title available?)
• Information, randomness and incompleteness. Papers on algorithmic information theory
• Kolmogorov's contributions to information theory and algorithmic complexity
• RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS
• Some informational properties of Markov pure-jump processes

Cited in

(15)

• Chaitin complexity, Shannon information content of a single event, and infinite random sequences. II
• A note on Kolmogorov complexity and entropy
• The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems
• Complexity measures in terms of general dynamics: the information capacitance
• On degrees of randomness and genetic randomness
• Complex entropy and resultant information measures
• scientific article; zbMATH DE number 5129599 (Why is no real title available?)
• scientific article; zbMATH DE number 5772803 (Why is no real title available?)
• Complexity of strings in the class of Markov sources
• scientific article; zbMATH DE number 4087585 (Why is no real title available?)
• Entropy and higher moments of information
• Reexamination of an information geometric construction of entropic indicators of complexity
• Building sources of zero entropy: rescaling and inserting delays (invited talk)
• From -entropy to KL-entropy: analysis of minimum information complexity density estima\-tion
• Entropy, search, complexity.

This page was built for publication: Entropic measures, Markov information sources and complexity

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