Description:In this book on algorithmic information theory, the author compares his concept of randomness, which is based on the complexity of the generating algorithm, with other concepts and discusses its relation to incompleteness and the halting problem. Algorithms are described in a dialect of LISP. The style mostly is that of a lecture, lively and readable.