Series: Penn State Logic Seminar Date: Tuesday, November 12, 2002 Time: 2:30 - 3:45 PM Place: 312 Boucke Building Speaker: Carl Mummert, Mathematics, Penn State Title: Kolmogorov Complexity and 1-Random Reals, part 2 Abstract: This talk is a continuation of the talk that I gave on October 29. After a brief review of the results presented there, I will show that several definitions of 1-randomness are equivalent. Two of these definitions are measure-theoretic, while the other are based on Kolmogorov complexity. I will also discuss additional properties of the (self-delimiting) Kolmogorov Complexity H not covered in Part I, including the maximum complexity of a string of length n.