逻辑比较操作的物理限制
The physical limit of logical compare operation
摘要：
本文用两台相连的Szilard单分子发动机（不同温度）的麦克斯韦妖模型，对逻辑比较运算进行了论证和分析。比较运算的逻辑和物理复杂度都是kTln ~ 2。利用该极限证明了排序问题的时间复杂度下界。它证实了所提出的方法来衡量一个问题的复杂性，提供了另一个证据之间的等价性信息理论和热力学熵。
英文摘要：
In this paper two connected Szilard single molecule engines (with different temperature) model of Maxwell's demon are used to demonstrate and analysis the logical compare operation. The logical and physical complexity of compare operations are both showed to be kTln2. Then this limit was used to prove the time complexity lower bound of sorting problem. It confirmed the proposed way to measure the complexity of a problem, provided another evidence of the equivalence between information theoretical and thermodynamic entropies.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
