Algorithmic thermodynamics

作者：Baez John^*; Stay Mike

来源：Mathematical Structures in Computer Science, 2012, 22(5): 771-787.

DOI：10.1017/S0960129511000521

Algorithmic entropy can be viewed as a special case of the entropy studied in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodynamics to the subject of algorithmic information theory. In particular, suppose we fix a universal prefix-free Turing machine and let X be the set of programs that halt for this machine. Then we can regard X as a set of %26apos;microstates%26apos;, and treat any function on X as an %26apos;observable%26apos;. For any collection of observables, we can study the Gibbs ensemble that maximises entropy subject to constraints on the expected values of these observables. We illustrate this by taking the log runtime, length and output of a program as observables analogous to the energy E, volume V and number of molecules N in a container of gas. The conjugate variables of these observables allow us to define quantities we call the %26apos;algorithmic temperature%26apos; T, %26apos;algorithmic pressure%26apos; P and %26apos;algorithmic potential%26apos; mu, since they are analogous to the temperature, pressure and chemical potential. We derive an analogue of the fundamental thermodynamic relation dE = TdS - PdV + mu dN, and use it to study thermodynamic cycles analogous to those for heat engines. We also investigate the values of T, P and mu for which the partition function converges. At some points on the boundary of this domain of convergence, the partition function becomes uncomputable - indeed, at these points the partition function itself has non-trivial algorithmic entropy.

• 出版日期2012-10