Algorithmic relative complexity

DOI10.3390/E13040902zbMATH Open1229.68046OpenAlexW2095699593MaRDI QIDQ657564FDOQ657564

Authors Daniele Cerra, Mihai Datcu

Publication date 9 January 2012

Published in Entropy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3390/e13040902

zbMATH Keywords

Kullback-Leibler divergencerelative entropycompressionKolmogorov complexitysimilarity measurecompression based distance

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Methods and applications of algorithmic complexity. Beyond statistical lossless compression
• Kolmogorov complexity in perspective. II: Classification, information processing and duality
• scientific article; zbMATH DE number 2080439
• Information distance
• Inductive complexity and Shannon entropy

Cites work

• scientific article; zbMATH DE number 5608251 (Why is no real title available?)
• scientific article; zbMATH DE number 2061729 (Why is no real title available?)
• A Mathematical Theory of Communication
• A formal theory of inductive inference. Part I
• A measure of relative entropy between individual sequences with application to universal classification
• An introduction to Kolmogorov complexity and its applications
• Clustering by Compression
• On Information and Sufficiency
• On the Length of Programs for Computing Finite Binary Sequences
• Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity
• Shared Information and Program Plagiarism Detection
• The Similarity Metric
• Three approaches to the quantitative definition of information^*

Cited in

(6)

• Algorithmic folding complexity
• Complementarity of information obtained by Kolmogorov and Aksentijevic-Gibson complexities in the analysis of binary time series
• Expanding the algorithmic information theory frame for applications to Earth observation
• scientific article; zbMATH DE number 6026956 (Why is no real title available?)
• Relative complexity of random walks in random sceneries
• Kolmogorov complexity in perspective. II: Classification, information processing and duality

This page was built for publication: Algorithmic relative complexity

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