Abstract
The finite sequences the algorithmic complexities of which, with respect to a universal Turing machine, do not differ substantially from their corresponding lengths are known to be good simulations of statistically independent random samples from the equiprobable distribution. The aim of this paper is to suggest a possibility how to define, using the apparatus of algorithmic complexity, pseudo-random independent and equally distributed samples from a general probability distribution over a finite set and pseudo-Markov samples with a finite set of possible states.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. S. Chow, H. Teicher: Probability Theory — Independence, Interchangeability, Martingales. Springer Verlag, Berlin-Heidelberg-New York, 1978.
T. L. Fine: Theories of Probability — an Examination of Foundations. Academic Press, New York — London, 1973.
I. Kramosil: Recursive Classification of Pseudo-Random Sequences. Kybernetika (Prague), 20(1984) — Supplement, pp. 1–34.
I. Kramosil, J. Šindelář: Infinite Sequences of High Algorithmic Complexity. Kybernetika 20(1984), 6, pp. 459–466.
I. Kramosil: Independent and Identically Distributed Pseudo-Random Samples. Submitted for publication.
C.-P. Schnorr: Zufälligskeit und Wahrscheinlichkeit. Lect. Notes in Math. Springer-Verlag, Berlin-Heidelberg-New York, 1971.
J. A. Storer: Toward an Abstract Theory of Data Compression. Theoretical Comp. Sci. 24(1983), 3, pp. 221–237.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kramosil, I. (1986). On some types of pseudo-random sequences. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016273
Download citation
DOI: https://doi.org/10.1007/BFb0016273
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16783-9
Online ISBN: 978-3-540-39909-4
eBook Packages: Springer Book Archive