1. An Introduction to Algorithmic Information Theory Nuri Taşdemir 17-11-2006

2. Randomness Random-bit generators Random bits –11111111111111111111111111111111 –01000110110000010100111001011101 –00100100001111110110101010001000

3. Complexity Time complexity Space complexity Program-size complexity

4. Universal computers

5. CN is an immune set

6. Prefix-free codes Instantaneous Uniquely decodable

7. Self-delimiting TM Input tape Work tape Output tape

8. Probability of obtaining a string on C

9. Halting Probability Ω

10. Ω is a solution for Halting Problem Unfortunately Ω is incomputable

11. Thank you