Computing Theory Course

Computing Theory

Time: 9:10--12:20 Tuesday
Location: Room 105

---Class of 2000, M.S. (overheard)

A professor always included this question on his final exams:
"What did you think of this course?"
He discontinued the practice after receiving this response:
"This was the most complete course I ever took.
Anything we didn't go over during class
was covered in the final exam."
---Adapted from Reader's Digest

Two hunters are being pursued by a bear;
one stops to change into his running shoes.
The other tells him he is crazy: there is no
way he can run faster than a bear.
``I don't have to run faster than a bear,''
replies the first. ``I only have to run faster than you.''
The Economist, 18 March 2002

To the students,

This course emphasizes computational complexity and its applications. We will go over, in my opinion, the most interesting and/or important results in the field. You are expected to read the textbook for any background knowledge not covered in the lectures if your undergraduate education has not prepared you for this course. The textbook will, in general, be followed.

The mathematical techniques used in this course are wide-ranging but accessible. Undergraduate discrete mathematics course should be more than adequate. Math majors should be prepared to find standard mathematics used in unexpected ways. Combinatorics, probability, graph theory, number theory, and, to a less extent, group theory are the principal analytical tools. We shall skip predicate logic (Frege 1879) and the associated profound results of completeness and incompleteness (Godel 1930, 1931).

I hope you will be rewarded with the insights, sense of beauty, and applications that some of the results convey. There is also the satisfaction that, unlike many other fields in computer science (including those taught by me), many of the topics will still be taught to students decades from now.

Homework should be turned in on time, before 9:10. Otherwise, it will be considered late. Homework can be written in Chinese or English. If you have to use emails to turn in the homework, please use the PDF format with your student ID number as the file name and send it using your NTU or NTUCSIE email account. Time stamp will be used to determine if the homework is late or not. Beware of the potential email reliability problem. You are expected to finish your own homework on your own. Do not copy or collaborate with fellow students. Never give your homework to other students or publish your homework because it may be copied and you in turn may be suspected of copying other's homework!

If you prefer, you may submit your homework solutions via the CEIBA system before the stated deadlines. Name your file StudentID_HW_# for easy reference. Example: R91723054_HW_2.pdf.

Notes [ 2001, 2002, 2003, 2004, 2005, 2006, 2008a, 2008b, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017 ]

  1. 2017.09.12
  2. 2017.09.19
  3. 2017.09.26
  4. 2017.10.03
  5. 2017.10.10 national holiday
  6. 2017.10.17
  7. 2017.10.24 & mid-term exam & solutions
  8. 2017.10.31
  9. 2017.11.07
  10. 2017.11.14
  11. 2017.11.21
  12. 2017.11.28 & mid-term exam & solutions
  13. 2017.12.05
  14. 2017.12.12
  15. 2017.12.19
  16. 2017.12.26
  17. 2018.01.02
  18. 2018.01.09 & final exam & solutions

Examinations and grading

  1. There is a mid-term exam on xxx, 2017 (closed book).
  2. There is a mid-term exam on xxx, 2017 (closed book).
  3. There is a final exam on xxx, 2018 (closed book).

The major results covered in the course, time permitting, are listed below for your reference.