# Algorithmic Randomness and Complexity

Textbook

Part of the Theory and Applications of Computability book series (THEOAPPLCOM)

1. Front Matter
Pages i-xxviii
2. ### Background

1. Front Matter
Pages 1-1
2. Rodney G. Downey, Denis R. Hirschfeldt
Pages 2-6
3. Rodney G. Downey, Denis R. Hirschfeldt
Pages 7-109
4. Rodney G. Downey, Denis R. Hirschfeldt
Pages 110-153
5. Rodney G. Downey, Denis R. Hirschfeldt
Pages 154-196
6. Rodney G. Downey, Denis R. Hirschfeldt
Pages 197-224
3. ### Notions of Randomness

1. Front Matter
Pages 225-225
2. Rodney G. Downey, Denis R. Hirschfeldt
Pages 226-268
3. Rodney G. Downey, Denis R. Hirschfeldt
Pages 269-322
4. Rodney G. Downey, Denis R. Hirschfeldt
Pages 323-401
4. ### Relative Randomness

1. Front Matter
Pages 403-403
2. Rodney G. Downey, Denis R. Hirschfeldt
Pages 404-463
3. Rodney G. Downey, Denis R. Hirschfeldt
Pages 464-499
4. Rodney G. Downey, Denis R. Hirschfeldt
Pages 500-553
5. Rodney G. Downey, Denis R. Hirschfeldt
Pages 554-591
6. Rodney G. Downey, Denis R. Hirschfeldt
Pages 592-666
5. ### Further Topics

1. Front Matter
Pages 667-667
2. Rodney G. Downey, Denis R. Hirschfeldt
Pages 668-704
3. Rodney G. Downey, Denis R. Hirschfeldt
Pages 705-727

### Introduction

Intuitively, a sequence such as 101010101010101010… does not seem random, whereas 101101011101010100…, obtained using coin tosses, does. How can we reconcile this intuition with the fact that both are statistically equally likely? What does it mean to say that an individual mathematical object such as a real number is random, or to say that one real is more random than another? And what is the relationship between randomness and computational power. The theory of algorithmic randomness uses tools from computability theory and algorithmic information theory to address questions such as these. Much of this theory can be seen as exploring the relationships between three fundamental concepts: relative computability, as measured by notions such as Turing reducibility; information content, as measured by notions such as Kolmogorov complexity; and randomness of individual objects, as first successfully defined by Martin-Löf. Although algorithmic randomness has been studied for several decades, a dramatic upsurge of interest in the area, starting in the late 1990s, has led to significant advances. This is the first comprehensive treatment of this important field, designed to be both a reference tool for experts and a guide for newcomers. It surveys a broad section of work in the area, and presents most of its major results and techniques in depth. Its organization is designed to guide the reader through this large body of work, providing context for its many concepts and theorems, discussing their significance, and highlighting their interactions. It includes a discussion of effective dimension, which allows us to assign concepts like Hausdorff dimension to individual reals, and a focused but detailed introduction to computability theory. It will be of interest to researchers and students in computability theory, algorithmic information theory, and theoretical computer science.

### Keywords

Algorithms algorithm complexity complexity theory computability theory computational geometry computer computer science information theory logic modeling

#### Authors and affiliations

1. 1.School of Mathematics, Statistics &, Operations ResearchVictoria UniversityWellingtonNew Zealand
2. 2., Department of MathematicsUniversity of ChicagoChicagoUSA

### Bibliographic information

• Book Title Algorithmic Randomness and Complexity
• Authors Rodney G. Downey
Denis R. Hirschfeldt
• Series Title Theory and Applications of Computability
• DOI https://doi.org/10.1007/978-0-387-68441-3
• Publisher Name Springer, New York, NY
• eBook Packages Mathematics and Statistics Mathematics and Statistics (R0)
• Hardcover ISBN 978-0-387-95567-4
• Softcover ISBN 978-1-4939-3820-9
• eBook ISBN 978-0-387-68441-3
• Series ISSN 2190-619X
• Series E-ISSN 2190-6203
• Edition Number 1
• Number of Pages XXVIII, 855
• Number of Illustrations 0 b/w illustrations, 0 illustrations in colour
• Topics
• Buy this book on publisher's site

## Reviews

From the reviews:

“Develops the prerequisites to algorithmic randomness: computability theory and Kolmogorov complexity. … Studying these … one should be able to proceed in the area with confidence. A draft of the book under review has been circulating for years and the reviewer found it to be the best source when attempting to conduct research in the area … . It is advantageous for the future of the area of algorithmic randomness that these two books were published at the cusp of a period of great activity.” (Bjørn Kjos-Hanssen, Mathematical Reviews, Issue 2012 g)

“A thorough and systematic study of algorithmic randomness, this long-awaited work is an irreplaceable source of well-presented classic and new results for advanced undergraduate and graduate students, as well as researchers in the field and related areas. The book joins a select number of books in this category.” (Hector Zenil, ACM Computing Reviews, October, 2011)