Pith. sign in

REVIEW 1 cited by

Relations between randomness deficiencies

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1608.08246 v1 pith:SSSVPRFJ submitted 2016-08-29 math.LO

classification math.LO
keywords deficienciesrandomnessdeficiencydifferencerandomsomeboundedclose
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The notion of random sequence was introduced by Martin-Loef in 1966. At the same time he defined the so-called randomness deficiency function that shows how close are random sequences to non-random (in some natural sense). Other deficiency functions can be obtained from the Levin-Schnorr theorem, that describes randomness in terms of Kolmogorov complexity. The difference between all of these deficiencies is bounded by a logarithmic term. In this paper we show that the difference between some deficiencies can be as large as possible.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Randomness, exchangeability, and conformal prediction

    cs.LG 2025-01 conditional novelty 4.0 of 10

    In classification, every confidence predictor that is valid under IID data can be transformed into a conformal predictor with an explicit, constant-free bound on the loss of efficiency.

Pith tools