Algorithmic complexity and efficiency of a ratchet

被引:4
|
作者
Arizmendi, CM
Family, F [1 ]
机构
[1] Emory Univ, Dept Phys, Atlanta, GA 30322 USA
[2] Univ Nacl Mar del Plata, Fac Ingn, Dept Fis, RA-7600 Mar Del Plata, Argentina
基金
美国国家科学基金会;
关键词
thermal ratchets; complexity; nonequilibrium dynamics;
D O I
10.1016/S0378-4371(99)00167-3
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Molecular motors are characterized by a high degree of efficiency of energy transformation in the presence of thermal fluctuations. A fundamental question is how the efficiency of thermal ratchets depend on temperature and the flow of physical information (or negentropy). In order to address this question, in this work we have calculated the algorithmic complexity (or Kolmogorov information entropy) of a smoothly varying potential ratchet, The complexity is measured in terms of the average number of bits per time unit necessary to specify the sequence generated by the system. For a wide range of values of the flipping rate, the algorithmic complexity is found to be proportional to the efficiency in a flashing thermal ratchet. In addition, we find that at low temperatures, the algorithmic complexity (or efficiency) of a thermal ratchet increases with temperature. This is a highly counterintuitive result that may be important in the operation of molecular motors. (C) 1999 Elsevier Science B.V, All rights reserved.
引用
收藏
页码:285 / 292
页数:8
相关论文
共 50 条
  • [11] The Algorithmic Complexity of Landscapes
    Papadimitriou, Fivos
    LANDSCAPE RESEARCH, 2012, 37 (05) : 591 - 611
  • [12] The history of Algorithmic complexity
    Nasar, Audrey A.
    MATHEMATICS ENTHUSIAST, 2016, 13 (03): : 217 - 242
  • [13] Chaos and algorithmic complexity
    Batterman, RW
    White, H
    FOUNDATIONS OF PHYSICS, 1996, 26 (03) : 307 - 336
  • [14] On the algorithmic complexity of crystals
    Krivovichev, S. V.
    MINERALOGICAL MAGAZINE, 2014, 78 (02) : 415 - 435
  • [15] Algorithmic Folding Complexity
    Cardinal, Jean
    Demaine, Erik D.
    Demaine, Martin L.
    Imahori, Shinji
    Ito, Tsuyoshi
    Kiyomi, Masashi
    Langerman, Stefan
    Uehara, Ryuhei
    Uno, Takeaki
    GRAPHS AND COMBINATORICS, 2011, 27 (03) : 341 - 351
  • [16] Algorithmic Folding Complexity
    Cardinal, Jean
    Demaine, Erik D.
    Demaine, Martin L.
    Imahori, Shinji
    Langerman, Stefan
    Uehara, Ryuhei
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 452 - +
  • [17] Algorithmic theory of complexity
    Polizzi, Gaspare
    NUNCIUS-JOURNAL OF THE HISTORY OF SCIENCE, 2007, 22 (01): : 176 - 177
  • [18] Algorithmic Relative Complexity
    Cerra, Daniele
    Datcu, Mihai
    ENTROPY, 2011, 13 (04) : 902 - 914
  • [19] EVOLUTIONARY BIOLOGY A ratchet for protein complexity
    Doolittle, W. Ford
    NATURE, 2012, 481 (7381) : 270 - 271
  • [20] THE EIKONAL EQUATION: NUMERICAL EFFICIENCY VS. ALGORITHMIC COMPLEXITY ON QUADRILATERAL GRIDS
    Hysing, Shu-Ren
    Turek, Stefan
    ALGORITMY 2005: 17TH CONFERENCE ON SCIENTIFIC COMPUTING, PROCEEDINGS, 2005, : 22 - 31