Entropic measures, Markov information sources and complexity (Q1855845): Difference between revisions

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.

0 references

zbMATH Keywords

entropic measures

0 references

Shannon's entropy

0 references

entropy rate

0 references

Markov sources

0 references

complexity

0 references

algorithmic probability

0 references

Markov information sources

0 references

reviewed by

Guy Jumaric

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q3894827

0 references

Q4326782

0 references

CODING WITH MINIMAL PROGRAMS

0 references

0 references

0 references

0 references

0 references

RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS

0 references

Kolmogorov's contributions to information theory and algorithmic complexity

0 references

Q4023085

0 references

Q5822308

0 references

Some informational properties of Markov pure-jump processes

0 references

Q4074808

0 references

A proof of the Beyer-Stein-Ulam relation between complexity and entropy

0 references

Q4158954

0 references

Q4003734

0 references

Finite Continuous Time Markov Chains

0 references

Q4336750

0 references

Algorithmic information and simplicity in statistical physics

0 references

A Mathematical Theory of Communication

0 references

Q4040892

0 references

Q4934359

0 references

full work available at URL

https://doi.org/10.1016/s0096-3003(01)00199-0

0 references

Identifiers

zbMATH Open document ID

1029.94008

0 references

DOI

10.1016/S0096-3003(01)00199-0

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1855845

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57001704
@@ Property / Wikidata QID: Q57001704 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3894827
@@ Property / cites work: Q3894827 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4326782
@@ Property / cites work: Q4326782 / rank @@
+Normal rank
@@ Property / cites work @@
+CODING WITH MINIMAL PROGRAMS
@@ Property / cites work: CODING WITH MINIMAL PROGRAMS / rank @@
+Normal rank
@@ Property / cites work @@
+Q3995518
@@ Property / cites work: Q3995518 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2709403
@@ Property / cites work: Q2709403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942040
@@ Property / cites work: Q4942040 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4259438
@@ Property / cites work: Q4259438 / rank @@
+Normal rank
@@ Property / cites work @@
+RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS
@@ Property / cites work: RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS / rank @@
+Normal rank
@@ Property / cites work @@
+Kolmogorov's contributions to information theory and algorithmic complexity
+Normal rank
@@ Property / cites work @@
+Q4023085
@@ Property / cites work: Q4023085 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5822308
@@ Property / cites work: Q5822308 / rank @@
+Normal rank
@@ Property / cites work @@
+Some informational properties of Markov pure-jump processes
+Normal rank
@@ Property / cites work @@
+Q4074808
@@ Property / cites work: Q4074808 / rank @@
+Normal rank
@@ Property / cites work @@
+A proof of the Beyer-Stein-Ulam relation between complexity and entropy
+Normal rank
@@ Property / cites work @@
+Q4158954
@@ Property / cites work: Q4158954 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4003734
@@ Property / cites work: Q4003734 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite Continuous Time Markov Chains
@@ Property / cites work: Finite Continuous Time Markov Chains / rank @@
+Normal rank
@@ Property / cites work @@
+Q4336750
@@ Property / cites work: Q4336750 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic information and simplicity in statistical physics
+Normal rank
@@ Property / cites work @@
+A Mathematical Theory of Communication
@@ Property / cites work: A Mathematical Theory of Communication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040892
@@ Property / cites work: Q4040892 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4934359
@@ Property / cites work: Q4934359 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0096-3003(01)00199-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2047066710
@@ Property / OpenAlex ID: W2047066710 / rank @@
+Normal rank