CS 245: Logic and Computation — Fall 2018
Home
Course outline
Schedule of lectures
Assignments
Resource material
Piazza
Learn
Additional pages:
J. Buss
C. Bruni
S. McIntyre
David R. Cheriton School of Computer Science
Additional material (J. Buss)
Lecture topics and goals
For all lectures so far,
as shown in lecture
.
(Update last recorded on Sep. 10.)
Corrections and discussion of overheads
The missing cases for the proof of unique readibility for well-formed propositional formulas
(pp. 51,52).
The complete annotated code for the partition step of quicksort
.
Clicker questions
Sep. 28
Oct. 22
Additional Examples
Interpretations and envoronments
(Oct. 16)