Bhattacharjee, Somendra M. (2003) Entropy and perpetual computers arXiv e-print . pp. 1-9.
![[img]](http://repository.ias.ac.in/style/images/fileicons/application_pdf.png)
|
PDF
- Publisher Version
201kB |
Official URL: http://adsabs.harvard.edu/abs/2003cond.mat.10332B
Abstract
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.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to arXiv Publication. |
| Keywords: | Condensed Matter; Statistical Mechanics; High Energy Physics; Lattice; High Energy Physics; Theory; Quantum Physics |
| ID Code: | 3158 |
| Deposited On: | 11 Oct 2010 10:06 |
| Last Modified: | 16 May 2016 14:01 |
Repository Staff Only: item control page
