The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Thermodynamic cost of computation, algorithmic complexity and the information metric
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Savitzky-Golay Smoothing Filters
Press, W. H., & Teukolsky, S. A. (1990) · Computers in Physics · doi:10.1063/1.4822961 · Cited by 11,670
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
The thermodynamics of computation—a review
Bennett, C. H. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02084158 · Cited by 2,006
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896
A formal theory of inductive inference. Part II
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90131-7 · Cited by 1,758
Complexity, Entropy And The Physics Of Information
H. Zurek, W. (2018) · CRC Press eBooks · doi:10.1201/9780429502880 · Cited by 1,380
�ber die Entropieverminderung in einem thermodynamischen System bei Eingriffen intelligenter Wesen
Szilard, L. (1929) · Zeitschrift f�r Physik · doi:10.1007/bf01341281 · Cited by 1,248
A formal theory of inductive inference. Part I
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90223-2 · Cited by 1,192
Algorithmic Information Theory
Chaitin, G. J. (1977) · IBM Journal of Research and Development · doi:10.1147/rd.214.0350 · Cited by 982
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations
Chaitin, G. J. (1969) · Journal of the ACM · doi:10.1145/321495.321506 · Cited by 918
On the Length of Programs for Computing Finite Binary Sequences
Chaitin, G. J. (1966) · Journal of the ACM · doi:10.1145/321356.321363 · Cited by 913
A Theory of Program Size Formally Identical to Information Theory
Chaitin, G. J. (1975) · Journal of the ACM · doi:10.1145/321892.321894 · Cited by 849
Hamming, R. W. (1980) · Cited by 693
Randomness and Mathematical Proof
Chaitin, G. J. (1975) · Scientific American · doi:10.1038/scientificamerican0575-47 · Cited by 656
Logical basis for information theory and probability theory
Kolmogorov, A. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054210 · Cited by 592
Complexity as thermodynamic depth
Lloyd, S., & Pagels, H. (1988) · Annals of Physics · doi:10.1016/0003-4916(88)90094-2 · Cited by 517
Algorithmic Information Theory
Chaitin, G. J. (1987) · Cambridge University Press eBooks · doi:10.1017/cbo9780511608858 · Cited by 461
The Fundamental Physical Limits of Computation
Bennett, C. H., & Landauer, R. (1985) · Scientific American · doi:10.1038/scientificamerican0785-48 · Cited by 408
Time/Space Trade-Offs for Reversible Computation
Bennett, C. H. (1989) · SIAM Journal on Computing · doi:10.1137/0218053 · Cited by 405
Demons, Engines and the Second Law
Bennett, C. H. (1987) · Scientific American · doi:10.1038/scientificamerican1187-108 · Cited by 295
Notes on the history of reversible computation
Bennett, C. H. (1988) · IBM Journal of Research and Development · doi:10.1147/rd.321.0016 · Cited by 289
(1979) · Cited by 239
ELLAS, P. (1959) · Reviews of Modern Physics · doi:10.1103/revmodphys.31.221 · Cited by 223
Reversibility and Stability of Information Processing Systems
Zurek, W. H. (1984) · Physical Review Letters · doi:10.1103/physrevlett.53.391 · Cited by 92
Self-citationMaxwell’s Demon, Szilard’s Engine and Quantum Measurements
Zurek, W. H. (1986) · NATO ASI series. Series B : Physics · doi:10.1007/978-1-4613-2181-1_11 · Cited by 91
Self-citation
Cited by
Steane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120
Landauer, R. (1991) · Physics Today · doi:10.1063/1.881299 · Cited by 804
Bennett, C. H., Gacs, P., Li, M., Vitanyi, P. M. B., & Zurek, W. H. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.681318 · Cited by 506
Self-citationQuantum discord and Maxwell’s demons
Zurek, W. H. (2003) · Physical Review A · doi:10.1103/physreva.67.012320 · Cited by 346
Self-citation
Metadata
- Authors
- Zurek, W. H.
- Venue
- Nature
- Published
- 1989-09
- Volume
- 341
- Issue
- 6238
- Pages
- 119-124
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2024802184
- Cited by
- 279
- References
- 27
- FWCI
- 8.45
- 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.