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.Comment: 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 subsection
