Algorithmic Complexity in Noise Induced Transport Systems
| dc.creator | Arizmendi, C. M. | |
| dc.creator | Sanchez, J. R. | |
| dc.date | 1998-09-30 | |
| dc.date.accessioned | 2026-07-07T03:11:37Z | |
| dc.date.available | 2026-07-07T03:11:37Z | |
| dc.description | 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. | |
| dc.description | 7 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/cond-mat/9809433 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/9809433 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/28643 | |
| dc.subject | Statistical Mechanics | |
| dc.title | Algorithmic Complexity in Noise Induced Transport Systems | |
| dc.type | text |