# Algorithmic Information Theory

In the initial part of the course, we will follow the notes from
the 2010
offering. We will have the following topics in the second half
of the course.

## Special Topics

- Normal Numbers and finite-state compression
- The Lempel-Ziv algorithm, universal (over finite-state)
compression.
- Applications of expander graphs and extractors to Algorithmic
Information Theory.

## Homeworks

- Homework 1 due the Friday before
Midsem week.