# Classes

Classes 1-18Class 1: Introduction [PPT, PDF] (Notes) What is Computer Science?Class 2: Formal Systems and Languages [PPT, PDF] (Notes) Formal SystemsClass 3: Rules of Evaluation [PPT, PDF] (Notes) Learning LanguagesClass 4: The Value of Everything [PPT, PDF] (Notes) Problem Set 1Class 5: Procedures Practice (Notes) Class 6: Programming with Data [PPT, PDF] (Notes) Making dataClass 7: List Recursion Practice (Notes) Class 8: Recursing Lists (Notes) More list recursion examples: Class 9: Recursing Recursivey [PPT, PDF] (Notes) Recursive Procedures Class 10: Puzzling Pegboards [PPT, PDF] (Notes) PS2 and PS3Class 11: One Percent Luck [PPT, PDF] (Notes) Finishing the Pegboard PuzzleClass 12: Something About Sneezewort [PPT, PDF] (Notes) Measuring CostClass 13: Cost of Sorts [PPT, PDF] (Notes) Measuring CostClass 14: Asymptotic Growth [PPT, PDF] (Notes) Class 15: Quicker Sorting [PPT, PDF] (Notes) insert-sort Class 16: Quickest Sorting [PPT, PDF] (Notes) Sorting with trees Class 17: Double Deltas and Banburismus [PPT, PDF] (Notes) Cryptography at Bletchley Park Class 18: The Story So Far [PPT, PDF] (Notes) Finishing Tree Sorting |
Classes 19-Class 19: Programming with State [PPT, PDF] (Notes) Set expressions Class 20: Sex, Religion, and Politics [PPT, PDF] (Notes) Endless Golden AgesClass 21: Think Locally, Mutate Globally [PDF] (Notes) EnvironmentsClass 22: Objectifying Objects [PPT, PDF] (Notes) ObjectsClass 23: Programming with Objects [PPT, PDF] (Notes) Object-Oriented ProgrammingClass 24: Gödel's Proof [PPT, PDF] Class 25: Gödel and Computability [PPT, PDF] (Notes) Finishing Gödel's ProofClass 26: Proving Uncomputability [PPT, PDF] (Notes) The Halting ProblemClass 27: Viruses and Object-Oriented Programming [PPT, PDF] (Notes) Uncomputability of Virus Detection ProblemClass 28: Implementing Interpreters [PPT, PDF] Why learn Python?Class 29: Charme School (Notes) Disecting the Charme InterpreterClass 30: Lazy Evaluation [PPT, PDF] (Notes) Class 31: Types of Types [PPT, PDF] (Notes) Finishing LazyCharmeClass 32: Truthiness [PPT, PDF] (Notes) Static Type CheckingClass 33: Networking [PPT, PDF] (Notes) Class 34: Guest Lecture by Gary McGraw Class 35: Semi-Secure Websites Buffer overflowsClass 36: Modeling Computing [PPT, PDF] Turing's ModelClass 37: Universal Computers [PPT, PDF] (Notes) Universal Turing MachineClass 38: "Career Day" Kinga Dobolyi:Class 39: Lambda Calculus [PPT, PDF] (Notes) Class 40: Computing with Glue and Photons [PPT, PDF] Class 41: P = NP? [PPT, PDF] (Notes) |