Pages that link to "Item:Q1431991"
From MaRDI portal
The following pages link to A note on Kolmogorov complexity and entropy (Q1431991):
Displaying 11 items.
- A note on the Kolmogorov data complexity and nonuniform logical definitions (Q290271) (← links)
- Relative complexity of random walks in random sceneries (Q693714) (← links)
- Large alphabets and incompressibility (Q845735) (← links)
- The application of the construction of Kolmogorov complexity and of a theorem by Maslov to semiotic systems (Q871788) (← links)
- Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers (Q1403411) (← links)
- A proof of the Beyer-Stein-Ulam relation between complexity and entropy (Q1587621) (← links)
- Entropic measures, Markov information sources and complexity (Q1855845) (← links)
- A standardized approach to the Kolmogorov–Sinai entropy (Q3183664) (← links)
- Shannon Entropy vs. Kolmogorov Complexity (Q3434702) (← links)
- Entropy of the<i>K</i>-Satisfiability Problem (Q4492386) (← links)
- An operational characterization of mutual information in algorithmic information theory (Q5002777) (← links)