Algorithmic randomness and complexity

Computability and complexity theory are two central areas of research in theoretical computer science.

This book is concerned with the theories as applied to problems of the real number and other continuous structures, an area which has grown rapidly in recent years.