An algorithmic complexity interpretation of lin's third law of information theory

Research output: Contribution to journalArticlepeer-review

11 Scopus citations


Instead of static entropy we assert that the Kolmogorov complexity of a static structure such as a solid is the proper measure of disorder (or chaoticity). A static structure in a surrounding perfectly-random universe acts as an interfering entity which introduces local disruption in randomness. This is modeled by a selection rule R which selects a subsequence of the random input sequence that hits the structure. Through the inequality that relates stochasticity and chaoticity of random binary sequences we maintain that Lin's notion of stability corresponds to the stability of the frequency of Is in the selected subsequence. This explains why more complex static structures are less stable. Lin's third law is represented as the inevitable change that static structure undergo towards conforming to the universe's perfect randomness.

Original languageEnglish
Pages (from-to)6-14
Number of pages9
Issue number1
StatePublished - Mar 2008


  • Algorithmic complexity
  • Binary sequences
  • Entropy
  • Information theory
  • Randomness


Dive into the research topics of 'An algorithmic complexity interpretation of lin's third law of information theory'. Together they form a unique fingerprint.

Cite this