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

Details An algorithmic complexity interpretation of Lin's third law of information theory An algorithmic complexity interpretation of Lin's third law of information theory

2008-02-28

arxiv.org/abs/0802.4089v2

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An algorithmic complexity interpretation of Lin's third law of information theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An algorithmic complexity interpretation of Lin's third law of information theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An algorithmic complexity interpretation of Lin's third law of information theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-471141