February 1, 2011: Lecture 1 (pdf/ppt) - The Computational Universe
February 3, 2011: Lecture 2 (pdf/ppt) - Telling a robot how to behave
February 8, 2011: Lecture 3 (pdf/ppt) - Telling a computer how to behave
February 10, 2011: Lecture 4 (pdf/ppt) - Creating new worlds inside the computer
February 15, 2011: Lecture 5 (pdf/ppt) - “It ain’t no good if it ain’t snappy enough.”
February 17, 2011: Lecture 6 (pdf/ppt) - Seek and Ye shall Find
February 22, 2011: Lecture 7 (pdf/ppt) - It sure is smart but can it swing?
February 24, 2011: Lecture 8 (pdf/ppt) - What computers just cannot do
March 1, 2011: Lecture 9 (pdf/ppt) - What computers just cannot do (Part II)
March 3, 2011: Lecture 10 (pdf/ppt) - An introduction to boolean logic
March 8, 2011: Lecture 11 (pdf/ppt) - Computing via boolean logic
March 22, 2011: Lecture 12 (pdf/ppt) - How circuits acquire memory: Sequential & Clocked Circuits
March 24, 2011: Lecture 13 (pdf/ppt) - Finite State Machines (FSMs) and RAMs and CPUs
March 29, 2011: Lecture 14 (pdf/ppt) - How to streamline your life (lessons from computer architecture)
March 31, 2011: Lecture 15 (pdf/ppt) - What computers talk about and how (Networking and the Internet)
April 5, 2011: Lecture 16 (pdf/ppt) - Viruses, Worms, Zombies, and other Beasties
April 7, 2011: Lecture 17 (pdf/ppt) - The science that drives modern computers
April 12, 2011: Lecture 18 (pdf/ppt) - What is the computational cost of automating brilliance or serendipity?(Computational complexity and P vs NP question)
