CSE 725 - Computability and Unsolvability

Winter 2010

Thought provoking links:

http://rjlipton.wordpress.com/2010/01/20/are-the-reals-really-uncountable/
http://en.wikipedia.org/wiki/Busy_beaver

Textbook:

Introduction to the Theory of Computation, second edition. M. Sipser.

Recommended reading:

Computational Complexity. C. Papadimitriou.
Computational Complexity: A Modern Approach. Sanjeev Arora and Boaz Barak (free draft available).

Syllabus:

PDF

Office hours:

By instructor: MW 2:30-3:30pm in DL 495 or by appointment.
By grader (Ping Lai): Th 2:30-3:30pm in DL 774.

Problem Sets:

PS1 (due lecture on January 27th).
PS2 (due lecture on February 24th).
PS3 (due lecture on March 10th).

Final Exam:

As scheduled by OSU, Wed, March 17, 1:30 PM - 3:18 PM

Topics by lecture (tentative):

friendster
analytics