Previous |  Up |  Next

Article

Title: On pseudo-random sequences and their relation to a class of stochastical laws (English)
Author: Kramosil, Ivan
Author: Šindelář, Jan
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 28
Issue: 5
Year: 1992
Pages: 383-391
.
Category: math
.
MSC: 03D15
MSC: 60A99
MSC: 68Q30
idZBL: Zbl 0773.60006
idMR: MR1197721
.
Date available: 2009-09-24T18:33:43Z
Last updated: 2012-06-06
Stable URL: http://hdl.handle.net/10338.dmlcz/125861
.
Reference: [1] C. Calude: Theories of Computational Complexity.North-Holland, Amsterdam - New York - Oxford - Tokyo 1988. Zbl 0633.03034, MR 0919945
Reference: [2] T. L. Fine: Theories of Probability - an Examination of Foundations.Academic Press, New York 1973. Zbl 0275.60006, MR 0433529
Reference: [3] I. Kramosil, J. Šindelář: Infinite pseudo-random sequences of high algorithmic complexity.Kybernetika 20 (1984), 6, 429-437. MR 0777977
Reference: [4] I. Kramosil, J. Šindelář: A note on the law of iterated logarithm from the viewpoint of Kolmogorov program complexity.Problems Control Inform. Theory 16 (1987), 6, 399-409. MR 0930650
Reference: [5] P. Martin-Löf: The definition of random sequences.Inform, and Control 9 (1966), 4, 602-619. MR 0223179
Reference: [6] P. Martin-Löf: Complexity oscillations in infinite binary sequences.Z. Wahrsch. Verw. Gebiete 19 (1971), 2, 225-230. MR 0451322
Reference: [7] V. G. Vovk: The law of the iterated logarithm for sequences that are random in the sense of Kolmogorov or chaotic (in Russian).Teor. Veroyatnost. i Primenen. 32 (1987), 3, 456-468. MR 0914936
.

Files

Files Size Format View
Kybernetika_28-1992-5_3.pdf 537.1Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo