goto UNSW home page  
Contacts Library myUNSW WebCT
Theory of Computation - COMP4141
PRINT THIS PAGE
Students studying
 
Faculty: Faculty of Engineering
 
 
School:  School of Computer Science and Engineering
 
 
Campus: Kensington Campus
 
 
Career: Postgraduate
 
 
Units of Credit: 6
 
 
Contact Hours per Week: 4
 
 
Enrolment Requirements:
 
 
Prerequisite: A total of 75% in level 3 COMP courses, minimum of 18uoc.
 
 
Offered: To be advised
 
 
Fee Band: 2
 
 

Description

Computability: primitive recursive functions, computable functions, universal programs, undecidability, Church-Turing thesis, Turing machines, recursively enume rable sets and elementary recursive function theory; Complexity: the sets P and NP, NP-completeness and Cooks theorem. Logic: predicate logic and its unsatisfiability problem.

URL for this page:

© The University of New South Wales (CRICOS Provider No.: 00098G), 2004-2011. The information contained in this Handbook is indicative only. While every effort is made to keep this information up-to-date, the University reserves the right to discontinue or vary arrangements, programs and courses at any time without notice and at its discretion. While the University will try to avoid or minimise any inconvenience, changes may also be made to programs, courses and staff after enrolment. The University may also set limits on the number of students in a course.