Non-random structures in universal compression and the Fermi paradox
Open accessThe DOI matches its Crossref record; 32 of the 33 references it cites were found in a registry or an index.
Abstract
We study the hypothesis of information panspermia assigned recently among possible solutions of the Fermi paradox (“where are the aliens?”). It suggests that the expenses of alien signaling can be significantly reduced, if their messages contained compressed information. To this end we consider universal compression and decoding mechanisms (e.g. the Lempel-Ziv-Welch algorithm) that can reveal non-random structures in compressed bit strings. The efficiency of the Kolmogorov stochasticity parameter for detection of non-randomness is illustrated, along with the Zipf’s law. The universality of these methods, i.e. independence from data details, can be principal in searching for intelligent messages.
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?
The cited source says what the claim attributes to it.
In the citing paper
“Any advanced intelligence may compress information to the extent that we mistake their signals for noise [3].”
From Compression, The Fermi Paradox and Artificial Super-Intelligence (2022) · cites this paper as [3]
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
The Fractal Geometry of Nature
Mandelbrot, B. B., & Wheeler, J. A. (1983) · American Journal of Physics · doi:10.1119/1.13295 · Cited by 21,832
The Fractal Geometry of Nature.
Sparrow, C., & Mandelbrot, B. (1984) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981858 · Cited by 14,546
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
Compression of individual sequences via variable-rate coding
Ziv, J., & Lempel, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055934 · Cited by 3,432
Elements of Information Theory
Jacobs, K. (1992) · Discrete Stochastics · doi:10.1007/978-3-0348-8645-1_7 · Cited by 2,918
ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
SIMON, H. A. (1955) · Biometrika · doi:10.1093/biomet/42.3-4.425 · Cited by 2,771
On the Complexity of Finite Sequences
Lempel, A., & Ziv, J. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055501 · Cited by 2,717
A Technique for High-Performance Data Compression
Welch (1984) · Computer · doi:10.1109/mc.1984.1659158 · Cited by 2,182
The definition of random sequences
Martin-Löf, P. (1966) · Information and Control · doi:10.1016/s0019-9958(66)80018-9 · Cited by 1,220
Research works printed but not linked: 4
- V.G. Gurzadyan, Observatory 125, 352 (2005)
- A.N. Kolmogorov, Probl. Inf. Transfer 1, 3 (1965)
- S. Shostak, Prog. Search Extraterr. Life 74, 447 (1995)
- A.N. Kolmogorov, Giorn. Ist. Ital. Attuari 4, 83 (1933)
Cited by
Compression, The Fermi Paradox and Artificial Super-Intelligence
Bennett, M. T. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-93758-4_5 · Cited by 31
“Any advanced intelligence may compress information to the extent that we mistake their signals for noise [3].”
BackgroundTwo halves of a meaningful text are statistically different
Deng, W., Xie, R., Deng, S., & ALLAHVERDYAN, A. E. (2021) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/abe947 · Cited by 5
Self-citation
Metadata
- Authors
- Gurzadyan, A. V., & Allahverdyan, A. E.
- Affiliations
- Russian-Armenian University (AM)
- A. Alikhanyan National Laboratory (AM)
- Corresponding author
- Gurzadyan, A. V.
- Venue
- The European Physical Journal Plus
- Published
- 2016-02
- Volume
- 131
- Issue
- 2
- ISSN
- 2190-5444 (ISSN-L)
- OpenAlex
- W2269941284
- Cited by
- 2
- References
- 33
- Citations by year
- 2022: 1 · 2021: 1
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- The European Physical Journal Plus (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Physics and Astronomy › Astronomy and Astrophysics › Space Science and Extraterrestrial Life
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Keywords
- Fermi paradox, universal compression, Lempel-Ziv-Welch algorithm, Zipf's law
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Non-random structures in universal compression and the Fermi paradox. https://app.cochat.ai/papers/10.1140/epjp/i2016-16026-6
- The paper
- Gurzadyan, A. V., & Allahverdyan, A. E. (2016). Non-random structures in universal compression and the Fermi paradox. The European Physical Journal Plus. https://doi.org/10.1140/epjp/i2016-16026-6
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.