Information Flow and Computation in the Maxwell Demon Problem

Simple item page
dc.creatorJones, Roger D.
dc.creatorRedsun, Sven G.
dc.creatorFrye, Roger E.
dc.date2004-01-01
dc.date.accessioned2026-07-07T05:50:48Z
dc.date.available2026-07-07T05:50:48Z
dc.descriptionIn this paper we examine the Maxwell Demon problem from an information theoretic and computational point-of-view. In particular we calculate the required capacity of a communication channel that transports information to and from the Demon. Equivalently, this is the number of bits required to store the information on a computer tape. We show that, in a simple model for the Maxwell Demon, the entropy of the universe increases by at least an amount eta=0.83999552 bits per particle in going from unsorted to sorted particles and by an amount eta*=2.37314 in going from one sorted state to another sorted state.
dc.description30 pages, 3 figures, submitted to J. Stat. Phys
dc.identifierhttps://arxiv.org/abs/physics/0401002
dc.identifierhttp://arxiv.org/abs/physics/0401002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/85830
dc.subjectClassical Physics
dc.subjectGeneral Physics
dc.titleInformation Flow and Computation in the Maxwell Demon Problem
dc.typetext

Files

Collections

arXiv