Abstract:
This paper is a subjective, short overview of algorithmic information theory. We
critically discuss various equivalent algorithmical models of randomness motivating
a "randomness hypothesis". Finally some recent results on computably enumerable
random reals are reviewed.