Tuesday  1:30–2:45 p.m. 
Thursday  1:30–2:45 p.m. 
Sanders Physics 105 
Tuesday  Thursday  

Models of computation

Aug. 29 
Aug. 31 
Finite automata

Sep. 5 
Sep. 7 
Regular languages and automata

Sep. 12 
Sep. 14 
Regular and nonregular languages

Sep. 19 
Sep. 21 
Exam 1 
Sep. 26Exam 1 review 
Sep. 28Exam 1 
Contextfree grammars

Oct. 3 
Oct. 5 
Pushdown automata

Oct. 10 
Oct. 12 
October Break 
Oct. 17🍁 
Oct. 19🍂 
Contextfree and noncontextfree languages

Oct. 24 
Oct. 26 
Exam 2 
Oct. 31Exam 2 review 
Nov. 2Exam 2 
Turing machines

Nov. 7 
Nov. 9 
Decidable languages

Nov. 14 
Nov. 16 
The limits of computation

Nov. 21 
Nov. 23🥧 
Computability

Nov. 28Computability and reductions 
Nov. 30The big picture 
Review 
Dec. 5Exam 3 review 
Dec. 7📚 
Final exams 
Dec. 12📝 
Dec. 14Exam 3 
Presentday computers are built of transistors and wires, but they could just as well be built, according to the same principles, from valves and water pipes, or from sticks and string. The principles are the essence of what makes a computer compute. One of the most remarkable things about computers is that their essential nature transcends technology.W. Daniel Hillis, The Pattern on the Stone, 1998