CS 503 Theory of Computation
Turing machines; recursive numbers and Turing computability; solvability and unsolvable problems; concepts of and results on computational complexity; some NP complete problems
Lecture — CS 503
| Section | When | Where | Instructor | CRN | |
|---|---|---|---|---|---|
| 0 | Tue 10:40–12:30 Fri 16:40–17:30 |
FASS 1101 FASS 1099 |
Kemal İnan | 20249 | syllabus |
CS 503 — Sabancı Üniversitesi Spring 2026-2027 ders programı: section'lar, saatler, derslikler, CRN'ler ve syllabus bağlantıları.