Class Info:

Key questions

• What problems can you solve with a computer (computability theory)
• Why are some problems harder to solve than others? (complexity theory)
• How can we be certain in our answers to these questions? (discrete mathematics)

Staff email list:

[email protected]

Asking Questions

• EdStem: edstem.org/us/courses/27833/discussion
• Cs103.stanford.edu
• Problem Set 0: due Friday at 2:30 PM

Midterms

• Monday October 24th: 7-10 PM
• Monday, November 14th 7-10 PM

Final Exam: Tuesday December 13th, 8:30 AM-11:30 AM

Lecture 0: