Back to Information Theory
Information Theory1 min read
Kolmogorov Complexity of Spectral Signatures
Examining the algorithmic information content of spectral signatures.
TEYA SOL LAB
·Kolmogorov complexityspectral analysisalgorithmic information
Algorithmic Information
While Shannon entropy measures statistical information, Kolmogorov complexity measures the algorithmic information content - the length of the shortest program that produces a given output.
Complexity of Spectra
A simple physical system produces a spectrum that can be described by a short program (e.g., a few sinusoids). A complex system produces a spectrum requiring a long program to reproduce. This connection between physical complexity and algorithmic complexity guides our approach to structural classification.
Topics covered
#Kolmogorov complexity#spectral analysis#algorithmic information