COW :: Courseware :: Courses :: ceng565 - 20162
METU Ceng On the Web
| print-view
: Theory of Computation
InfoStaff
description: Turing Machines. Church-Turing thesis. Decidability. Reducibility and recursion theorem. Complexity Theory: Classes P and NP, NP-Completeness. Space complexity. Intractability.
oibs-code: 5710565
Instructors:
  • Faruk Polat
    email:
    OfficeHours: NULL
    room: A405
Assistants:
  • Omer Ekmekci
    email:
    OfficeHours: Tuesday(11:00 - 12:00)
    room: B204
    tel: 5532
There may be some hidden items below this line (such as lectureNotes available to only course-students. You need to login first to see all available items.
Announcements
    Lecture NotesExams
    • final : 2017-06-07 09:30:00, rooms: bmb4
    • evaluation : 2017-05-15 09:40:00, rooms: bmb4
    • midterm : 2017-04-24 09:40:00, rooms: bmb4
    • midterm : 2017-03-20 09:40:00, rooms: bmb4
    Homeworks
    homeworks
    topic:
    [[+hid]] hw_title deadline graded selectit
    1 4336 the1 2017-03-02 23:55:00 yes select
    2 4376 THE2 2017-04-24 23:59:59 yes select
    3 4420 THE3 2017-05-28 23:59:59 yes select
    Links
      | top
      2017-09-25 03:47:28, 0.035 secs
      COW by: Ahmet Sacan