Previous |  Up |  Next

Article

Title: Recursive classification of pseudo-random sequences (English)
Author: Kramosil, Ivan
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 20
Issue: 7
Year: 1984
Pages: (1),3-34
.
Category: math
.
MSC: 60A99
MSC: 65C10
MSC: 68Q15
MSC: 68Q30
idZBL: Zbl 0544.60006
idMR: MR0758385
.
Date available: 2009-09-24T17:44:25Z
Last updated: 2012-06-05
Stable URL: http://hdl.handle.net/10338.dmlcz/124460
.
Reference: [1] M. Davis: Computability and Unsolvability.McGraw Hill Book Company, New York-Toronto-London 1958. Zbl 0080.00902, MR 0124208
Reference: [2] T. L. Fine: Theories of Probability. An Examination of Foundations.Academic Press, New York-London 1973. Zbl 0275.60006, MR 0433529
Reference: [3] I. Kramosil: Monte-Carlo methods from the point of view of algorithmic complexity.In: Transactions of the Ninth Prague Conference on Information Theory, Statistical Decision Functions and Random Processes, Academia, Prague 1983, pp. 39-51. Zbl 0551.68039, MR 0757724
Reference: [4] I. Kramosil: Pseudo-random Monte-Carlo methods.Ann. Soc. Math. Polon. Ser. IV. Fund. Inform. 5 (1982), 3-4, 301-312. Zbl 0502.65082
Reference: [5] I. Kramosil: On pseudo-random sequences over finite alphabets.Ann. Soc. Math. Polon. Ser. IV. Fund. Inform. (to appear).
.

Files

Files Size Format View
Kybernetika_20-1984-7_1.pdf 1.503Mb application/pdf View/Open
Back to standard record
Partner of
EuDML logo