Abstract
In this chapter, we will introduce three cornerstone approaches to the definition of algorithmic randomness for infinite sequences.
(i) The computational paradigm: Random sequences are those whose initial segments are all hard to describe or equivalently, hard to compress. This approach is probably the easiest one to understand in terms of the previous sections.
(ii) The measure-theoretic paradigm: Random sequences are those with no “effectively rare” properties. If the class of sequences satisfying a given property is an effectively null set, then a random sequence should not have this property. This approach is the same as the stochastic paradigm: a random sequence should pass all effective statistical tests.
(iii) The unpredictability paradigm: This approach stems from what is probably the most intuitive conception of randomness, namely that one should not be able to predict the next bit of a random sequence, even if one knows all preceding bits, in the same way that a coin toss is unpredictable even given the results of previous coin tosses.
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.
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Downey, R.G., Hirschfeldt, D.R. (2010). Martin-Löf Randomness. In: Algorithmic Randomness and Complexity. Theory and Applications of Computability. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68441-3_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-68441-3_6
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95567-4
Online ISBN: 978-0-387-68441-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)