Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-22T05:40:01.145Z Has data issue: false hasContentIssue false

Maxwell's Demon and Computation

Published online by Cambridge University Press:  14 March 2022

Richard Laing*
Affiliation:
University of Michigan

Abstract

In this paper we show how a form of Maxwellian Demon can be interpreted as a computing automaton. We then point out some ways in which the Demon systems can be generalized, and briefly describe and discuss the properties of some of the corresponding automata. It is shown that a generalized Maxwell Demon system can carry out arbitrary Turing computations.

Finally, the association developed between classes of thermodynamic systems and classes of computational systems is employed to suggest approaches to some fundamental problems of the relationships between computation, the information obtained by computation, and energy.

Type
Research Article
Copyright
Copyright © 1974 by The Philosophy of Science Association

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This research was supported in part through a grant from the National Science Foundation.

References

REFERENCES

[1] Minsky, M.Recursive Unsolvability of Post's Problem of Tag and Other Topics in Theory of Turing Machines.” Annals of Mathematics 74 (1961): 437454CrossRefGoogle Scholar
[2] Shannon, C. E.A Universal Turing Machine with Two Internal States.” in Automata Studies. Edited by Shannon, C. E. and McCarthy, J. Princeton: Princeton University Press, 1956. Pages 157165.Google Scholar
[3] Szilard, L. “Über die Entropieverminderung in einem Thermodynamischen System bei Eingriffen intelligenter Wesen.” Zeitschrift für Physik 53 (1929) 840852. (A translation of this paper, under the title “On the Decrease of Entropy in a Thermodynamic System by the Intervention of Intelligent Beings” appeared in Behavioral Science 9 (1964): 301–310).Google Scholar
[4] Von Neumann, J. Theory of Self-Reproducing Automata. Edited and completed by A. W. Burks. Urbana, Illinois: University of Illinois Press, 1966.Google Scholar