Automata Computability Complexity
AY2026/2027 Semester 1
This course introduces the foundational theory of computation through the study of formal models such as finite automata, pushdown automata, and Turing machines, along with key ideas in computability and complexity. You will learn to reason rigorously about computational models, distinguish between decidable and undecidable problems, and classify problems based on their computational difficulty. These skills provide the theoretical basis for further studies in algorithms, programming languages, cryptography, and AI.
| AUs | 3.0 AUs |
| Categories | Core |
| Not Available To All Programme With | (Admyr 2011-2023) |
| Exam | 26 November 2026, 9.00 am - 11.00 am |
Available indexes
| Mon | Tue | Wed | Thu | Fri | ||||
|---|---|---|---|---|---|---|---|---|
| 1030 | COMMON LEC (SCL2) 1030-1220 Wed LT1A | 10310 TUT (SCSA) 1030-1120 Thu TR+6 Wk2-13 | 10311 TUT (SCSB) 1030-1120 Thu TR+3 Wk2-13 | |||||
| 1100 | ||||||||
| 1130 | 10424 TUT (SCSJ) 1130-1220 Mon TR+15 Wk2-13 | |||||||
| 1200 | ||||||||
| 1230 | 10432 TUT (TCMD) 1230-1320 Wed TR+6 Wk2-13 | |||||||
| 1300 | ||||||||
| 1330 | 10430 TUT (SCS4) 1330-1420 Wed TR+17 Wk2-13 | 10312 TUT (SCSC) 1330-1420 Fri TR+2 Wk2-13 | ||||||
| 1400 | ||||||||
| 1430 | 10423 TUT (SCSI) 1430-1520 Mon TR+9 Wk2-13 | 10426 TUT (SCSL) 1430-1520 Mon TR+22 Wk2-13 | ||||||
| 1500 | ||||||||
| 1530 | ||||||||
| 1600 | ||||||||
| 1630 | 10314 TUT (SCSE) 1630-1720 Mon TR+15 Wk2-13 | 10315 TUT (SCSF) 1630-1720 Mon TR+16 Wk2-13 | 10316 TUT (SCSG) 1630-1720 Tue TR+4 Wk2-13 | 10422 TUT (SCSH) 1630-1720 Tue TR+3 Wk2-13 | 10427 TUT (SCS1) 1630-1720 Fri TR+3 Wk2-13 | |||
| 1700 | ||||||||
| 1730 | 10425 TUT (SCSK) 1730-1820 Mon TR+15 Wk2-13 | 10428 TUT (SCS2) 1730-1820 Tue TR+3 Wk2-13 | ||||||
| 1800 | ||||||||