New: see the walk between your classes on the timetable

ModsSC2203

SC2203 Automata, Computability & Complexity

Current offering: AY2026/2027 Semester 2

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.

3hrs per week
AUs
3.0 AUs
Grade Type
None
Prerequisite
SC1007, SC2001(Corequisite), SC2301(Corequisite)
Exam
None

Prerequisite graph

SC2203

Automata, Computability & Complexity

Available indexes

MonTueWedThuFri
1030

COMMON LEC (SCL2)

1030-1120 Thu

LT3

Wk1-9,11-13

1100
1130
1200
1230
1300
1330
1400
1430

COMMON LEC (SCL2)

1430-1520 Tue

LT3

Wk1-9,11-13

1500
1530

10308 TUT (SDDA)

1530-1620 Tue

TR+3

Wk2-9,11-13

10309 TUT (SDDB)

1530-1620 Tue

TR+4

Wk2-9,11-13

1600

Other offerings

YearSem 1Sem 2Special
AY26/27View--
AY25/26ViewView-

Other relevant mods

Planning guides

View all articles

Found something wrong?

NTUMods is built and maintained by one person, so a short note goes a long way. Pick what fits, add the details, and I will look at it.

I'll use this to follow up with you.

Attaches your saved timetables and settings to help debug the issue. On by default, turn off to exclude it.

Developer? Open an issue or PR.