Historical snapshot — AY2025/2026 Semester 1 · View current offering →

Automata Computability Complexity

AY2025/2026 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

Available Indexes

	Mon	Tue	Wed	Thu	Fri
930
1000
1030
1100
1130
1200
1230
1300
1330
1400
1430
1500
1530
1600
1630
1700
1730
1800

	Tue		Wed				Thu
830	COMMON LEC (SCL2) 0830-1020 Tue ONLINE, LT2A Wk10, Teaching Wk1-9,11-13	COMMON LEC (SCL2) 0830-1020 Tue ONLINE, LT2A Wk10, Teaching Wk1-9,11-13
900
930			10259 TUT (TEL3) 0930-1020 Wed ONLINE, LT13 Wk10, Teaching Wk2-9,11-13	10259 TUT (TEL3) 0930-1020 Wed ONLINE, LT13 Wk10, Teaching Wk2-9,11-13	10260 TUT (TEL4) 0930-1020 Wed ONLINE, LT10 Wk10, Teaching Wk2-9,11-13	10260 TUT (TEL4) 0930-1020 Wed ONLINE, LT10 Wk10, Teaching Wk2-9,11-13
1000
1030
1100
1130							10257 TUT (TEL1) 1130-1220 Thu ONLINE, LT9 Wk10,13, Teaching Wk2-9,11,12	10257 TUT (TEL1) 1130-1220 Thu ONLINE, LT9 Wk10,13, Teaching Wk2-9,11,12	10258 TUT (TEL2) 1130-1220 Thu ONLINE, LT10 Wk10, Teaching Wk2-9,11-13	10258 TUT (TEL2) 1130-1220 Thu ONLINE, LT10 Wk10, Teaching Wk2-9,11-13
1200
1230
1300
1330	10261 TUT (TEL5) 1330-1420 Tue ONLINE, LT9 Wk10, Teaching Wk2-9,11-13	10261 TUT (TEL5) 1330-1420 Tue ONLINE, LT9 Wk10, Teaching Wk2-9,11-13
1400