Artificial sequences and complexity measures

DOI10.1088/1742-5468/2005/04/P04002zbMath1456.94030arXivcond-mat/0403233OpenAlexW3099675966MaRDI QIDQ4968837

A. Baronchelli, Emanuele Caglioti, Vittorio Loreto

Publication date: 9 July 2019

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0403233

zbMATH Keywords

analysis of algorithmssource and channel codingnew applications of statistical mechanics

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Time-dependent statistical mechanics (dynamic and nonequilibrium) (82C99) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Measures of information, entropy (94A17) Information theory (general) (94A15)

Related Items

Non-sequential recursive pair substitution: some rigorous results

Uses Software

• PHYLIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• A new challenge for compression algorithms: Genetic sequences
• Using literal and grammatical statistics for authorship attribution
• Data compression and learning in time sequences analysis
• Dynamical systems and computable information
• Analysis of symbolic sequences using the Jensen-Shannon divergence
• Clustering by Compression
• The Similarity Metric
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression
• A measure of relative entropy between individual sequences with application to universal classification
• Nonparametric entropy estimation for stationary processes and random fields, with applications to English text
• Entropy estimation of symbol sequences
• Ergodic theory of chaos and strange attractors
• Information distance
• Fifty years of Shannon theory
• An Introduction to Symbolic Dynamics and Coding
• On the Length of Programs for Computing Finite Binary Sequences
• A formal theory of inductive inference. Part I
• A formal theory of inductive inference. Part II
• On Information and Sufficiency
• Predictability: a way to characterize complexity