Next Article in Journal
Gibbs’ Paradox and the Definition of Entropy
Next Article in Special Issue
Symmetry Rules: How Science and Nature Are Founded on Symmetry. By Joe Rosen. Springer: Berlin. 2008, XIV, 305 p. 86 illus., Hardcover. CHF 70. ISBN: 978-3-540-75972-0
Previous Article in Journal
Gibbs Paradox and the Concepts of Information, Symmetry, Similarity and Their Relationship
Article Menu

Article Versions

Export Article

Open AccessArticle
Entropy 2008, 10(1), 6-14; doi:10.3390/entropy-e10010006

An Algorithmic Complexity Interpretation of Lin's Third Law of Information Theory

Electrical and Electronic Engineering Department, Ariel University Center of Samaria, Ariel 40700, Israel
Received: 28 February 2008 / Revised: 16 March 2008 / Accepted: 19 March 2008 / Published: 20 March 2008
(This article belongs to the Special Issue Symmetry and Entropy)
Download PDF [183 KB, uploaded 24 February 2015]

Abstract

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 1s 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.
Keywords: Entropy; Randomness; Information theory; Algorithmic complexity; Binary sequences Entropy; Randomness; Information theory; Algorithmic complexity; Binary sequences
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Ratsaby, J. An Algorithmic Complexity Interpretation of Lin's Third Law of Information Theory. Entropy 2008, 10, 6-14.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top