Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 362

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

On tables of random numbers

Open access
Kolmogorov, A.N.·1998·Theoretical Computer Science

Abstract

The set theoretic axioms of the calculus of probability, in formulating which I had the opportunity of playing some part (Kolmogorov, 1950), had solved the majority of formal difficulties in the construction of a mathematical apparatus which is useful for a very large number of applications of probabilistic methods, so successfully that the problem of finding the basis of real applications of the results of the mathematical theory of probability became rather secondary to many investigators. I have already expressed the view [see Kolmogorov (1950), Chapter I] that the basis for the applicability of the results of the mathematical theory of probabi lity to real 'random phenomena' must depend on some form of the frequency concept of probability, the unavoidable nature of which has been established by von Mises in a spirited manner. However, for a long time I had the following views. (1) The frequency concept based on the notion of limiting frequency as the number of trials increases to infinity, does not contribute anything to substantiate the applicability of the results of probability theory to real practical problems where we have always to deal with a finite number of trials. (2) The frequency concept applied to a large but finite number of trials does not admit a rigorous formal exposition within the framework of pure mathematics. Accordingly I have sometimes put forward the frequency concept which involves the conscious use of certain not rigorously formal ideas about 'practical reliability', 'approximate stability of the frequency in a long series of trials', without the precise definition of the series which are-'sufficiently large' etc. [see Foundation^ of the Theory of Probability, Chapter I and for more details Great Soviet Encyclo paedia (section on Probability) and Mathematika iou metod i Znachenye (Chapter on Probability Theory)]. I still maintain the first of the two theses mentioned above. As regards the second, however, I have come to realise that the concept of random distribution of a property in a large finite population can have a strict formal mathematical exposition. In fact, we can show that in sufficiently large populations the distribution of the pro perty may be such that the frequency of its occurrence will be almost the same for all sufficiently large sub-populations, when the law of choosing these is sufficiently simple. Such a conception in its full development requires the introduction of a measure of the complexity of the algorithm. I propose to discuss this question in another article. In the present article, however, I shall use the fact that there cannot be a very large number of simple algorithms. 369 3

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/s0304-3975(98)00075-9

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Research works printed but not linked: 2

  1. Kolmogorov, 1950, Section on ‘Probability’, Great Soviet Encyclopaedia
  2. Kolmogorov, 1950, Chapter on Probability Theory

Cited by

See all 362

Metadata

Authors
Kolmogorov, A. N.
Venue
Theoretical Computer Science
Publisher
Elsevier BV
Published
1998-11
Volume
207
Issue
2
Pages
387-395
ISSN
0304-3975 (ISSN-L)
OpenAlex
W2018140810
Cited by
362
References
2
FWCI
4.38
Type
journal article
Language
en
Open access
bronze
Licence

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: On tables of random numbers. https://app.cochat.ai/papers/10.1016/s0304-3975(98)00075-9
The paper
Kolmogorov, A. N. (1998). On tables of random numbers. Theoretical Computer Science. https://doi.org/10.1016/s0304-3975(98)00075-9

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.