Fundamental Limitations in the Computational Process
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Information in computers, in biological systems, or in any other form, inevitably requires the use of physical degrees of freedom. Information is not a purely mathematical or philosophical entity. It is subjected to physical restrictions and these are reviewed to the extent they are now understood. The discussion of memory is brief since this area is well documented in earlier reviews. Logic and switching processes are analyzed in more detail. Bennett's thesis that computing can be a completely reversible process, both logically and physically, with arbitrarily small energy dissipation, is demonstrated. The model used for this discussion is a Turing machine modelled, in general, on Bennett's work, but using the Fredkin gate as the basic device for interaction between information streams. Reversible computers can simulate evolutionary behavior and related games just as it is done today on practical computers. We can thus have a form of self‐organizing activity among the bit patterns, with very little energy expenditure. A brief discussion of systems which hold information with the aid of continual energy dissipation is also given. In multi‐stable systems of this sort the evaluation of relative stability between different states of local stability cannot be done by simply comparing the neighborhood of the states involved, but must include consideration of the detailed kinetics along the improbable intervening transition paths. As a consequence it is suggested that theories of biological evolution must consider the detailed kinetics along the paths of evolution. This cannot be avoided by thermodynamic or information‐theoretic shortcuts which only compare initial and final states.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Irreversibility and heat generation in the computing process
Landauer, R. (1961) · IBM Journal of Research and Development · doi:10.1147/rd.53.0183 · Cited by 4,980
Self-citationLogical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
Topics in the Theory of Random Noise
(1970) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(70)90203-x · Cited by 895
Cited by
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
Electrical transport in open and closed systems
Landauer, R. (1987) · Zeitschrift f�r Physik B Condensed Matter · doi:10.1007/bf01304229 · Cited by 478
Self-citationQuantum Mechanical Models of Turing Machines That Dissipate No Energy
Benioff, P. (1982) · Physical Review Letters · doi:10.1103/physrevlett.48.1581 · Cited by 295
Dissipation and noise immunity in computation and communication
Landauer, R. (1988) · Nature · doi:10.1038/335779a0 · Cited by 208
Self-citationBenioff, P. A. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857725 · Cited by 113
Minimum energy requirements of information transfer and computing
Bremermann, H. J. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857726 · Cited by 63
Metadata
- Authors
- Landauer, R.
- Venue
- Berichte der Bunsengesellschaft für physikalische Chemie
- Publisher
- Wiley
- Published
- 1976-11
- Volume
- 80
- Issue
- 11
- Pages
- 1048-1059
- ISSN
- 0005-9021 (ISSN-L)
- OpenAlex
- W2121397471
- Cited by
- 47
- References
- 4
- FWCI
- 4.06
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.