The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Algorithmic randomness and physical entropy
Abstract
Algorithmic randomness provides a rigorous, entropylike measure of disorder of an individual, microscopic, definite state of a physical system. It is defined by the size (in binary digits) of the shortest message specifying the microstate uniquely up to the assumed resolution. Equivalently, algorithmic randomness can be expressed as the number of bits in the smallest program for a universal computer that can reproduce the state in question (for instance, by plotting it with the assumed accuracy). In contrast to the traditional definitions of entropy, algorithmic randomness can be used to measure disorder without any recourse to probabilities. Algorithmic randomness is typically very difficult to calculate exactly but relatively easy to estimate. In large systems, probabilistic ensemble definitions of entropy (e.g., coarse-grained entropy of Gibbs and Boltzmann's entropy H=lnW, as well as Shannon's information-theoretic entropy) provide accurate estimates of the algorithmic entropy of an individual system or its average value for an ensemble. One is thus able to rederive much of thermodynamics and statistical mechanics in a setting very different from the usual. Physical entropy, I suggest, is a sum of (i) the missing information measured by Shannon's formula and (ii) of the algorithmic information content---algorithmic randomness---present in the available data about the system. This definition of entropy is essential in describing the operation of thermodynamic engines from the viewpoint of information gathering and using systems. These Maxwell demon-type entities are capable of acquiring and processing information and therefore can ``decide'' on the basis of the results of their measurements and computations the best strategy for extracting energy from their surroundings. From their internal point of view the outcome of each measurement is definite. The limits on the thermodynamic efficiency arise not from the ensemble considerations, but rather reflect basic laws of computation. Thus inclusion of algorithmic randomness in the definition of physical entropy allows one to formulate thermodynamics from the Maxwell demon's point of view.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Yet, in the appropriate limit, Eqs. (5.66)-(5.67), the asymptotic entropy production rate defined with the help of the algorithmic contribution discussed above (i.e., in a manner of the physical entropy , Zurek (1989)) does not depend on the strength or nature of the coupling, but is instead given by the sum of the positive Lyapunov exponents.”
From Decoherence, einselection, and the quantum origins of the classical (2003) · cites this paper as Zurek (1989)
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.tb00917.x · Cited by 48,949
Information theory and statistical mechanics
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.106.620 · Cited by 12,931
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
Hammersley, J. M., & Handscomb, D. C. (1964) · Springer eBooks · doi:10.1007/978-94-009-5819-7 · Cited by 4,054
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
Information Theory and Statistical Mechanics. II
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.108.171 · Cited by 3,253
Hartle, J. B., & Hawking, S. W. (1983) · Physical Review D · doi:10.1103/physrevd.28.2960 · Cited by 3,027
Mathematical foundations of quantum mechanics
Offenbacher, E. L. (1955) · Journal of the Franklin Institute · doi:10.1016/0016-0032(55)90752-3 · Cited by 2,930
The thermodynamics of computation—a review
Bennett, C. H. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02084158 · Cited by 2,006
Wehrl, A. (1978) · Reviews of Modern Physics · doi:10.1103/revmodphys.50.221 · Cited by 1,963
Environment-induced superselection rules
Zurek, W. H. (1982) · Physical Review D · doi:10.1103/physrevd.26.1862 · Cited by 1,415
Self-citationBlack holes and thermodynamics
Hawking, S. W. (1976) · Physical Review D · doi:10.1103/physrevd.13.191 · Cited by 1,307
Pointer basis of quantum apparatus: Into what mixture does the wave packet collapse?
Zurek, W. H. (1981) · Physical Review D · doi:10.1103/physrevd.24.1516 · Cited by 1,257
Self-citationThe definition of random sequences
Martin-Löf, P. (1966) · Information and Control · doi:10.1016/s0019-9958(66)80018-9 · Cited by 1,220
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
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
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
Meyer (1903) · Monatshefte für Mathematik und Physik · doi:10.1007/bf01707005 · Cited by 587
Algorithmic Information Theory
Chaitin, G. J. (1987) · Cambridge University Press eBooks · doi:10.1017/cbo9780511608858 · Cited by 461
Penrose, O. (1975) · Physics Bulletin · doi:10.1088/0031-9112/26/4/026 · Cited by 311
Ford, J. (1983) · Physics Today · doi:10.1063/1.2915570 · Cited by 291
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
World as system self-synthesized by quantum networking
WHEELER, J. A. (1988) · IBM Journal of Research and Development · doi:10.1147/rd.321.0004 · Cited by 80
Computation and physics: Wheeler's meaning circuit?
Landauer, R. W. (1986) · Foundations of Physics · doi:10.1007/bf01886520 · Cited by 60
Cited by
Decoherence, einselection, and the quantum origins of the classical
Zurek, W. H. (2003) · Reviews of Modern Physics · doi:10.1103/revmodphys.75.715 · Cited by 4,295
Self-citationPreferred States, Predictability, Classicality and the Environment-Induced Decoherence
Zurek, W. H. (1993) · Progress of Theoretical Physics · doi:10.1143/ptp/89.2.281 · Cited by 525
Self-citationBennett, 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-citationSecond law of quantum complexity
Brown, A. R., & Susskind, L. (2018) · Physical Review D · doi:10.1103/physrevd.97.086015 · Cited by 292
“In some respects it is a more physical quantity than entropy in that it is defined for each instance and does not make reference to the state of knowledge of the observer [25].”
Background
Metadata
- Authors
- Zurek, W. H.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 1989-10-01
- Volume
- 40
- Issue
- 8
- Pages
- 4731-4751
- ISSN
- 0556-2791 (ISSN-L)
- OpenAlex
- W2010954373
- Cited by
- 364
- References
- 26
- FWCI
- 7.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.