Entropic measures, Markov information sources and complexity
From MaRDI portal
(Redirected from Publication:1855845)
complexityalgorithmic probabilityShannon's entropyMarkov sourcesentropy rateentropic measuresMarkov information sources
Statistical aspects of information-theoretic topics (62B10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Measures of information, entropy (94A17) Continuous-time Markov processes on discrete state spaces (60J27) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Recommendations
Cites work
- 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?)
- 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
- 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)- scientific article; zbMATH DE number 4087585 (Why is no real title available?)
- scientific article; zbMATH DE number 5129599 (Why is no real title available?)
- Reexamination of an information geometric construction of entropic indicators of complexity
- Entropy and higher moments of information
- Entropy, search, complexity.
- From -entropy to KL-entropy: analysis of minimum information complexity density estima\-tion
- A note on Kolmogorov complexity and entropy
- Complex entropy and resultant information measures
- scientific article; zbMATH DE number 5772803 (Why is no real title available?)
- The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems
- Complexity of strings in the class of Markov sources
- Chaitin complexity, Shannon information content of a single event, and infinite random sequences. II
- On degrees of randomness and genetic randomness
- Complexity measures in terms of general dynamics: the information capacitance
- Building sources of zero entropy: rescaling and inserting delays (invited talk)
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)