COMP3630 Theory of Computation
Later Year Course
| Offered By | Department of Computer Science |
|---|---|
| Academic Career | Undergraduate |
| Course Subject | Computer Science |
| Offered in | First Semester, 2009 and First Semester, 2010 |
| Unit Value | 6 units |
| Course Description |
This course covers the theoretical computer science areas of formallanguages and automata, computability and complexity. Topics covered include: regular and context-free languages; finite automata and pushdown automata; Turing machines; Church's thesis; computability - halting problem, solvable and unsolvable problems; space and time complexity; classes P, NP and PSPACE; NP-Completeness.
|
| Indicative Assessment |
Assignments (40%); Final Exam (60%) |
| Areas of Interest | Computer Science |
| Requisite Statement |
The information published on the Study at ANU 2009 website applies to the 2009 academic year only. All information provided on this website replaces the information contained in the Study at ANU 2008 website.
