Maxwell Demon问题中的信息流与计算
Information Flow and Computation in the Maxwell Demon Problem
摘要：
在本文中，我们研究麦克斯韦恶魔问题从信息论和计算的角度来看。特别是，我们计算所需的通信信道的容量，传输信息，从恶魔。等价地，这是在计算机磁带上存储信息所需的位数。我们表明，在一个简单的模型麦克斯韦恶魔，宇宙的熵增加了至少一个量η =0.83999552比特每粒子从未排序的粒子和一个量η *=2.37314从一个排序状态到另一个排序状态。
英文摘要：
In this paper we examine the Maxwell Demon problem from an information theoretic and computational point-of-view. In particular we calculate the required capacity of a communication channel that transports information to and from the Demon. Equivalently, this is the number of bits required to store the information on a computer tape. We show that, in a simple model for the Maxwell Demon, the entropy of the universe increases by at least an amount eta=0.83999552 bits per particle in going from unsorted to sorted particles and by an amount eta*=2.37314 in going from one sorted state to another sorted state.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
