Top

Top | recent changes | Preferences

Showing revision 94

UCR CS 215 (Fall, 2004) - Theory of Computation

What kinds of problems can be, or cannot be, solved using computers? How do we formally model and reason about computation?


Latest news:

Goals for the end of the class: understand decidability, undecidability, polynomial-time reductions, NP completeness

/FinalExam

don't forget: quiz on Tuesday, Nov 23 on Chapter 7 - the class P, and NP-completeness

quiz 4 solutions - upload:quiz4_solns.pdf
hwk 5 - upload:hwk5.pdf - (for review, not graded)

information about /Grades

http://www.cs.ucr.edu/~neal/index.cgi?q=chapter --- introduction to approximation algorithms for NP optimization problems.
http://www.nada.kth.se/theory/problemlist.html --- a catalog of approximability results for NP optimization problems.

study groups are meeting Mondays, Thursdays 3:30-5pm in surge 349
proofs groups are meeting Tuesdays (surge 284), Thursdays (surge 349), noon - 1:30

proofs group problems week of nov 22 - /ProofsGroup1122

quiz 3 solutions - upload:quiz3solns.pdf
quiz 2 solutions - upload:quiz2_solns.pdf
quiz 1 solutions - /EntranceQuizSolns

hwk 4 solutions - upload:hwk4_solns.pdf
hwk 3 solutions - upload:hwk3_solns.pdf
hwk 2 solutions - /Hwk2Solns
hwk 1, prob 2 soln - /TuringMachineSimulator.Cc - TM simulator in C++ (see also /TuringMachineSimulator.Py - in python)

Miscellany

/LectureSummaries -- summaries of the first 5 class meetings

proofs group from a previous term

/TentativeTopics, /SimilarCourses, /MeetingSchedule, /ReferenceMaterials

The official UCR catalogue entry is here.


Top | recent changes | Preferences
This page is read-only | View other revisions | View current revision
Edited November 29, 2004 2:17 pm by Neal Young (diff)
Search: