Great Theoretical Ideas in Computer Science
Welcome to 15-251! This course will take a philosophical and historical perspective on the development of theoretical computer science. From using a pile of stones to represent and manipulate numbers, humans have progressively developed an abstract vocabulary with which to mathematically represent their world. The ancients, especially the Greeks, realized that they could consistently reason about their representations in a step-by-step manner. In other words, by computing in abstract models, they could describe and predict patterns in the world around them.
Starting with ancient algorithms for arithmetic, we will revisit the development of mathematics from a computational point of view. Conversely, we will mathematically study the nature of computation itself. What is computation? What is computable, in principle? What is especially easy, or especially hard to compute? To what extent does the inherent nature of computation shape how we learn and think about the world?
- Tues/Thurs 9:00 - 10:20am
- GHC 4401 (Rashid Auditorium)
- Instructors: Bernhard Haeupler and Ryan O’Donnell
- A: 9:30 (DH 1209): Tom, Thomson
- B: 10:30 (GHC 4211): Calvin, Ananya
- C: 11:30 (DH 1217): Apoorva, Chris J
- D: 12:30 (GHC 4102): Evan, Patrick
- E: 1:30 (DH 1217): Zhichun, Anna
- F: 2:30 (GHC 5222): Raunak, Bill
- G: 3:30 (DH 1217): Chris L, James
- Wed 6:30 - 7:50 pm (DH 2210)