Top

Top | recent changes | Preferences

Difference (from prior major revision) (author diff)

Added: 11a12


Added: 12a14


Removed: 16d17


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?

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


Latest news:

Saturday final exam moved to Surge 284 and time period extended (show up between 8 and 10, leave three hours later)

information about /Grades and /FinalExam

/RedoHwks --- redo hwks 2,3 or 4 if you like

hwk 5 solutions - upload:hwk5_solns.pdf - (for review, not graded)

/PracticeProblemsWithSolutions

proofs group problems week of nov 29 - /ProofsGroup1122

advanced topics: /ApproximationAlgorithms , /KolmogorovComplexity, /RecursionTheorem

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

quiz 4 solutions - upload:quiz4_solns.pdf
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


Top | recent changes | Preferences
This page is read-only | View other revisions
Last edited December 7, 2004 2:13 pm by Neal Young (diff)
Search: