Algorithmic Complexity in Noise Induced Transport Systems

Details Algorithmic Complexity in Noise Induced Transport Systems Algorithmic Complexity in Noise Induced Transport Systems

1998-09-30

arxiv.org/abs/cond-mat/9809433v1

Physics

Condensed Matter

Statistical Mechanics

7 pages, 2 figures

Scientific paper

Time correlated fluctuations interacting with a spatial asymmetry potential are sufficient conditions to give rise to transport of Brownian particles. The transfer of information coming from the nonequilibrium bath, viewed as a source of negentropy, give rise to the correlated noise. The algorithmic complexity of an object provides a means of quantitating its information contents. The Kolmogorov information entropy or algorithmic complexity is investigated in order to quantitate the transfer of information that occurs in computational models showing noise induced transport. The complexity is measured in terms of the average number of bits per time unit necessary to specify the sequence generated by the system.

Affiliated with

Also associated with

No associations

Rating

Algorithmic Complexity in Noise Induced Transport Systems 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 Algorithmic Complexity in Noise Induced Transport Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic Complexity in Noise Induced Transport Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138476