A whole lotta notes, check it out!

Is it possible to communicate reliably from one point to another if we only have a noisy communication channel? How can the information content of a random variable be measured? This course will discuss the remarkable theorems of Claude Shannon, starting from the source coding theorem, which motivates the entropy as the measure of information, and culminating in the noisy channel coding theorem. Along the way we will study simple examples of codes for data compression and error correction.

from the Florida State University

Find some usefull lectures inside

Lecture notes on compiler design by the University of Regina

Some lectures on Turing Machines and the Halting problem

NOTE: Direct link to Realplayer file

From Columbia Univeristy.The Network Book aims to provide a comprehensive introduction to networking and distributed computing technologies. Unlike traditional textbooks, it pursues a top-down approach to the topic, starting with the application layer and then describing the transport and network layers, finally covering the physical layer.