COMP6363 Theory of Computation

About the course

This course covers the theoretical computer science areas of formal languages and automata, computability and complexity. Topics covered include the following: regular and context-free languages; finite automata and pushdown automata; Turing machines; computability - halting problem, solvable, and unsolvable problems; space and time complexity; classes P, NP and PSPACE; NP-Completeness.

When it meets

Every week

• Mon 09:00–10:00 lecture
• Tue 14:00–16:00 lecture

Choose one tutorial (2 options)

• Wed 11:30–13:00
• Wed 13:30–15:00
  Fri 08:30–10:00

2027 times aren't published yet, so these are last year's.

Requirements

To enrol in this course you must be studying Master of Computing OR Master of Computing (Advanced). Incompatible with COMP3630.

Wording from ANU Programs and Courses.