On tables of random numbers

DOI10.1016/S0304-3975(98)00075-9zbMath0948.68125OpenAlexW2018140810WikidataQ55871767 ScholiaQ55871767MaRDI QIDQ1275012

A. N. Kolmogorov

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00075-9

zbMATH Keywords

randomnessadmissible algorithmvon Mises' frequency concept

Mathematics Subject Classification ID

Collected or selected works; reprintings or translations of classics (01A75) Theory of computing (68Q99)

Related Items

ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS ⋮ Kolmogorov-Loveland stochasticity for finite strings ⋮ The principles of informational genomics ⋮ Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics) ⋮ Theory of graph neural networks: representation and learning ⋮ Unnamed Item ⋮ On the algorithmic complexity of static structures ⋮ An empirical study of the complexity and randomness of prediction error sequences ⋮ Double-base chains for scalar multiplications on elliptic curves ⋮ Kolmogorov-Loveland randomness and stochasticity ⋮ The Perils of Balance Testing in Experimental Design: Messy Analyses of Clean Data

Cites Work

• On the concept of a random sequence
• Unnamed Item
• Unnamed Item

This page was built for publication: On tables of random numbers