Entropy and perpetual computers
统计力学
2007-05-23 v2 高能物理 - 格点
高能物理 - 理论
量子物理
摘要
A definition of entropy via the Kolmogorov algorithmic complexity is discussed. As examples, we show how the meanfield theory for the Ising model, and the entropy of a perfect gas can be recovered. The connection with computations are pointed out, by paraphrasing the laws of thermodynamics for computers. Also discussed is an approach that may be adopted to develop statistical mechanics using the algorithmic point of view.
引用
@article{arxiv.cond-mat/0310332,
title = {Entropy and perpetual computers},
author = {Somendra M. Bhattacharjee},
journal= {arXiv preprint arXiv:cond-mat/0310332},
year = {2007}
}
备注
Based on Chanchal Majumdar memorial lectures given in Kolkata. 9 pages, 3 eps figures. For publication in "Physics Teacher"; v2. Sec 3 fragmented into smaller subsections