Previous |  Up |  Next

Article

Title: Infinite pseudo-random sequences of high algorithmic complexity (English)
Author: Kramosil, Ivan
Author: Šindelář, Jan
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 20
Issue: 6
Year: 1984
Pages: 429-437
.
Category: math
.
MSC: 60A05
MSC: 65C10
MSC: 68Q25
MSC: 68Q30
idZBL: Zbl 0558.68035
idMR: MR777977
.
Date available: 2009-09-24T17:43:27Z
Last updated: 2012-06-05
Stable URL: http://hdl.handle.net/10338.dmlcz/124602
.
Reference: [1] T L. Fine: Theories of Probability- An Examination of Foundations.Academic Press, New York-London 1973. Zbl 0275.60006, MR 0433529
Reference: [2] A. N. Kolmogorov: Combinatoric foundations of information theory and probability calculus.(in Russian). Uspehi matem. nauk 38 (1983), 4 (232), 27-36. MR 0710113
Reference: [3] I. Kramosil: On pseudo-random sequences over finite alphabets.Fundamenta Informaticae (to appear).
Reference: [4] I. Kramosil: Recursive classification of pseudo-random sequences.Supplement to Kybernetika 20 (1984), 1-36. MR 0758385
.

Files

Files Size Format View
Kybernetika_20-1984-6_1.pdf 674.6Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo