COW :: Courseware :: Courses :: ceng565 - 20182
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
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 : 2019-05-24 17:00:00, rooms: bmb3
    • evaluation : 2019-05-02 10:40:00, rooms: bmb3
    • midterm : 2019-04-25 10:40:00, rooms: bmb3
    • midterm : 2019-03-21 10:40:00, rooms: bmb3
    Homeworks
    homeworks
    topic:
    [[+hid]] hw_title deadline graded selectit
    The list is empty....
    Links
      | top
      2019-06-20 22:07:33, 1561057653.648 secs
      COW by: Ahmet Sacan