Speaker: Alon Brook
<P>
Abstract
In my talk I will give first a survey of the subject of AIT 
(Algorithmic Information Theory).
I will explain the main definitions. I will show  how  we can  use them to
define random infinite sequences.
I will also show how I use these definitions to get some new result in recursion
theory such as getting new relation that is $\Pi_2$  complete, an infinite
sequence of simple set, and that the set of the image of the information
function is Turing complete.