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 条
  • [31] ON THE ALGORITHMIC COMPLEXITY OF TOTAL DOMINATION
    LASKAR, R
    PFAFF, J
    HEDETNIEMI, SM
    HEDETNIEMI, ST
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (03): : 420 - 425
  • [32] Algorithmic complexity in the minority game
    Mansilla, R
    PHYSICAL REVIEW E, 2000, 62 (04): : 4553 - 4557
  • [33] Algorithmic Complexity of Multiplex Networks
    Santoro, Andrea
    Nicosia, Vincenzo
    PHYSICAL REVIEW X, 2020, 10 (02)
  • [34] ALGORITHMIC COMPLEXITY OF LIST COLORINGS
    KRATOCHVIL, J
    TUZA, Z
    DISCRETE APPLIED MATHEMATICS, 1994, 50 (03) : 297 - 302
  • [35] The Complexity of Cryptocurrencies Algorithmic Trading
    Cohen, Gil
    Qadan, Mahmoud
    MATHEMATICS, 2022, 10 (12)
  • [36] On algorithmic complexity of imprecise spanners
    Poureidi, Abolfazl
    Farshi, Mohammad
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2024, 117
  • [37] Algorithmic complexity of quantum capacity
    Samad Khabbazi Oskouei
    Stefano Mancini
    Quantum Information Processing, 2018, 17
  • [38] Algorithmic complexity of quantum capacity
    Oskouei, Samad Khabbazi
    Mancini, Stefano
    QUANTUM INFORMATION PROCESSING, 2018, 17 (04)
  • [39] On the algorithmic complexity of static structures
    Joel Ratsaby
    J. Chaskalovic
    Journal of Systems Science and Complexity, 2010, 23 : 1037 - 1053
  • [40] ON THE ALGORITHMIC COMPLEXITY OF STATIC STRUCTURES
    Ratsaby, Joel
    Chaskalovic, J.
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2010, 23 (06) : 1037 - 1053