|
This article is cited in 4 scientific papers (total in 4 papers)
Information Theory and Coding Theory
On Nonstochastic Objects
V. V. V'yugin
Abstract:
According to Kolmogorov, a finite object $x$ is called $(\alpha,\beta)$-stochastic, i.e., it satisfies stochastic dependences, if there exists a finite set $S$ such that $x\in A$, $K(A)\leq\alpha$ and $K(x)\geq\log_2|A|-\beta$, where $K$ is the ordinary Kolmogorov entropy (complexity), and $|A|$ is the number of elements of a set $A$. To define the concept of quasi-Kolmogorov stochasticity, the author examines the problem of the proportion of sequences that are not $(\alpha,\beta)$-stochastic. The principal results are as follows: Upper and lower bounds are obtained for the a priori countable measure of all sequences of length $n(\geq n)$ that are not $(\alpha,\beta)$-stochastic.
Received: 18.07.1983
Citation:
V. V. V'yugin, “On Nonstochastic Objects”, Probl. Peredachi Inf., 21:2 (1985), 3–9; Problems Inform. Transmission, 21:2 (1985), 77–83
Linking options:
https://www.mathnet.ru/eng/ppi979 https://www.mathnet.ru/eng/ppi/v21/i2/p3
|
|