Entropy and perpetual computers

Simple item page
dc.creatorBhattacharjee, Somendra M.
dc.date2003-10-15
dc.date2003-10-29
dc.date.accessioned2026-07-07T02:54:12Z
dc.date.available2026-07-07T02:54:12Z
dc.descriptionA 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.
dc.descriptionBased 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
dc.identifierhttps://arxiv.org/abs/cond-mat/0310332
dc.identifierhttp://arxiv.org/abs/cond-mat/0310332
dc.identifierPhys.Teacher 45 (2003) 12
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/22445
dc.subjectStatistical Mechanics
dc.subjectHigh Energy Physics - Lattice
dc.subjectHigh Energy Physics - Theory
dc.subjectQuantum Physics
dc.titleEntropy and perpetual computers
dc.typetext

Files

Collections

arXiv