Abstract
There are now 10 years that the theory of random sequences revived beginning with a stimulating paper of Kolmogorov in 1965. In this paper Kolmogorov proposed a definition of finite random sequences with respect to the equiprobability distribution. Those binary sequences x were considered to be random for which the minimal length of a description for x (program complexity of x) differed little from the length of x. The idea that randomness is related to the minimal length of descriptions was independently developed in Chaffin (1966). By introducing the concept of a universal algorithm Kolmogorov gave a rigorous definition of program complexity which no more depends on the choice of a special machine (or algorithm).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
Blum, M.: 1967, ‘A Machnie-Independent Theory of Recursive Functions’, Journal ACM 14.
Bos, U.: 1974, ‘Reelle Zufallsfolgen’, Dissertation Frankfurt.
Chaitin, G. J.: 1966, ‘On the Length of Programs for Computing Binary Sequences’, Journal ACM 13.
Chaitin, G. J.: 1975, ‘A Theory of Program Size Formally Identical to Information Theory’, Journal ACM 22.
Church, A.: 1940, ‘On the Concept of a Random Sequence’, Bull AMS 46, 130–135.
Daley, R.: 1975, ‘On the Inference of Optimal Descriptions’, Preprint University Chicago.
Fuchs, P.: 1975, ‘Zufälligkeit, Programmkomplexität und Lernbarkeit’, Dissertation Universität Frankfurt.
Gacs, P.: 1974, ‘On the Symmetry of Algorithmic Information’ Soviet Math. Dokl. 15.
Heyting, A.: 1956, ‘Intuitionism, an Introduction’ North-Holland Publ. Comp., Amsterdam, 1956.
Kolmogorov, A. N.: 1965, ‘Three Approaches to the Quantitative Definition of Information’, Problems of Information Transmission 1, 1–7.
Levin, L. A.: 1973, ‘On the Notion of a Random Sequence’, Soviet Math. Dokl. 14.
Levin, L. A.: 1974, ‘Laws of Information Conservation Non-increase and Problems of the Foundation of Probability Theory’, Problemi Peredaci Informacii 10.
Martin-Löf, P.: 1966, ‘The Definition of Random Sequences’, Inform. Control, 19, 602–619.
Martin-Löf, P.: 1970, ‘On the Notion of Randomness’, in: Intuitionism Proof Theory, Proc. Summer Conf. Buffalo, N.Y. 1968, 73–78.
Martin-Löf, P.: 1971, ‘Complexity Oscillations in Infinite Binary Sequences’. Zeit. Wahrsch. verw. Geb. 19, 225–230.
Meinhardt, G.: 1974, ‘Zufallsfolgen in reellen Wahrscheinlichkeitsräumen’, Diplomarbeit Erlangen/Frankfurt.
Schnorr, C. P.: 1969, ‘Eine Bemerkung zum Begriff der zufälligen Folge’, Zeit. Wahrsch. verw. Geb. 14.
Schnorr, C. P.: 1971, ‘Zufälligkeit und Wahrscheinlichkeit’, Lecture Notes in Mathematics Vol. 218, Springer-Verlag, Berlin-New York, 1971.
Schnorr, C. P.: 1973, ‘Process Complexity and Effective Random Tests’, J. Comp. System Sciences 7.
Schnorr, C. P.: 1974, Rekursive Funktionen und ihre Komplexität, Teubner Verlag, Stuttgart, 1974.
Schnorr, C. P., Fuchs, P.: 1975, ‘General Random Sequences and the Concept of Learnable Sequences’, Preprint Universität Frankfurt, to appear in J. Symb. Logic.
Ville, J.: 1939, Etude critique de la notion de collectif, Gauthiers-Villars, Paris, 1939.
Von Mises, R.: 1919, ‘Grundlagen der Wahrscheinlichkeitstheorie’, Math. Zeit. 5.
Zvonkin, A. and Levin, L.: 1970, ‘The Complexity of Finite Objects and the Develop ment of the Concepts of Information and Randomness by Means of the Theory of Algorithms’, Russian Math. Surveys 156, 83–124.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Schnorr, C.P. (1977). A Survey of the Theory of Random Sequences. In: Butts, R.E., Hintikka, J. (eds) Basic Problems in Methodology and Linguistics. The University of Western Ontario Series in Philosophy of Science, vol 11. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0837-1_12
Download citation
DOI: https://doi.org/10.1007/978-94-017-0837-1_12
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-8350-0
Online ISBN: 978-94-017-0837-1
eBook Packages: Springer Book Archive