The interplay between computability and randomness has been an active area of research in recent years, reflected by ample funding in the USA, numerous workshop

Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of

The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. T

Looking at a sequence of zeros and ones, we often feel that it is not random, that is, it is not plausible as an outcome of fair coin tossing. Why? The answer i

Recent findings in the computer sciences, discrete mathematics, formal logics and metamathematics have opened up a royal road for the investigation of undecidab