Course Code | COMP4141 |
Course Title |
Theory of Computation
|
Convenor | Paul Hunter |
Tutors | Paul Hunter |
|
Ethan Brown |
|
Ian Thorvaldson
|
Classes |
Lectures
: Mon 2-4, Online
Thu 12-2, Online |
Course Website | http://www.cse.unsw.edu.au/~cs4141 |
Handbook Entry | http://www.handbook.unsw.edu.au/undergraduate/courses/current/COMP4141.html |
After successfully completing this course, you will appreciate the fundamental questions of computer science:
The course timetable is available here.
After successfully completing this course, you will appreciate the fundamental questions of computer science:
After According to UNSW policy, graduate attributes are important because the disciplinary knowledge that students develop at university is not adequate in itself as the basis for their future lives. Instead, graduates need qualities and skills that equip them for lifelong learning. These include critical thinking and problem-solving skills as well as communication skills and information literacy skills.
This course contributes to the development of the following graduate capabilities:
Graduate Capability | Acquired in |
scholarship: understanding of their discipline in its interdisciplinary context | lectures |
scholarship: capable of independent and collaborative enquiry | tutorials, assignments |
scholarship: rigorous in their analysis, critique, and reflection | tutorials, assignments |
scholarship: able to apply their knowledge and skills to solving problems | assignments |
scholarship: capable of effective communication | forum |
scholarship: information literate | lectures, tutorials, assignments |
scholarship: digitally literate | lectures |
professionalism: capable of independent, self-directed practice | assignments |
professionalism: capable of operating within an agreed Code of Practice | all course-work, by doing it yourself |
global citizens: culturally aware and capable of respecting diversity and acting in socially just/responsible ways | interaction with your fellow students |
Prequisites:
After mastering this subject, students may want to follow on with other subjects that have a theoretical slant. These include:
The required textbook for this course is M Sipser, Introduction to the Theory of Computation , 3rd edition.
Additional notes are made available on the course website.
Other useful references for the material covered are:
Lectures will include exercises where we examine the practice of formulating and proving mathematical properties of relevance to Computer Science. Weekly tutorials aim to cement understanding and provide immediate and ongoing feedback for students to assess their understanding of the course material. Assignments aim to deepen analysis and understanding via additional examples and problems. There are no laboratory classes for this subject.
See also the section on Special Consideration .
The final mark is determined as the sum of the marks for the assessible components for this course:
The Student Code of Conduct ( Information , Policy ) sets out what the University expects from students as members of the UNSW community. As well as the learning, teaching and research environment, the University aims to provide an environment that enables students to achieve their full potential and to provide an experience consistent with the University’s values and guiding principles. A condition of enrolment is that students inform themselves of the University’s rules and policies affecting them, and conduct themselves accordingly.
In particular, students have the responsibility to observe standards of equity and respect in dealing with every member of the University community. This applies to all activities on UNSW premises and all external activities related to study and research. This includes behaviour in person as well as behaviour on social media, for example Facebook groups set up for the purpose of discussing UNSW courses or course work. Behaviour that is considered in breach of the Student Code Policy as discriminatory, sexually inappropriate, bullying, harassing, invading another’s privacy or causing any person to fear for their personal safety is serious misconduct and can lead to severe penalties, including suspension or exclusion from UNSW.
If you have any concerns, you may raise them with your lecturer, or approach the School Ethics Officer , Grievance Officer , or one of the student representatives .
Plagiarism is defined as using the words or ideas of others and presenting them as your own. UNSW and CSE treat plagiarism as academic misconduct, which means that it carries penalties as severe as being excluded from further study at UNSW. There are several on-line sources to help you understand what plagiarism is and how it is dealt with at UNSW:
Make sure that you read and understand these. Ignorance is not accepted as an excuse for plagiarism. In particular, you are also responsible that your assignment files are not accessible by anyone but you by setting the correct permissions in your CSE directory and code repository, if using. Note also that plagiarism includes paying or asking another person to do a piece of work for you and then submitting it as your own work.
UNSW has an ongoing commitment to fostering a culture of learning informed by academic integrity. All UNSW staff and students have a responsibility to adhere to this principle of academic integrity. Plagiarism undermines academic integrity and is not tolerated at UNSW. Plagiarism at UNSW is defined as using the words or ideas of others and passing them off as your own.
If you haven't done so yet, please take the time to read the full text of
The pages below describe the policies and procedures in more detail:
You should also read the following page which describes your rights and responsibilities in the CSE context:
If your work in this course is affected by unforeseen adverse circumstances, you should apply for Special Consideration through MyUNSW, including documentation on how your have been affected. If your request is reasonable and your work has clearly been impacted, then
Note the use of the word "may". None of the above is guaranteed. It depends on you making a convincing case that the circumstances have clearly impacted your ability to work.
If you are registered with Disability Services, please forward your documentation to Paul Hunter within the first two weeks of semester.
The following is a tentative schedule of when topics will be covered.
Week | Topic | Reading in Sipser |
1 |
Sets, functions, languages, finite automata
|
Chapters 0 & 1 |
2 |
Regular languages
|
Chapter 1 |
3 |
Context-Free languages, PDAs, non-CFLs
|
Chapters 2 & 4 |
4 |
Turing Machines, Recursive and Recursively enumerable languages
|
Chapter 3
|
5 |
Undecidability, Halting Problem, Reductions, Rice's Theorem
|
Chapters 3 & 4 |
6 |
"Flexibility week"
|
|
7 |
Time and space complexity, P and NP
|
Chapter 7
|
8-9 |
NP-completeness, SAT, PTIME reductions
|
Chapter 7 |
10
|
PSPACE, LogSPACE, Savitch's Theorem, Alternation
|
Chapters 8 & 9 |
11 |
Probabilistic complexity, Approximation and Optimization
|
Chapter 10
|
This course is being continuously improved and we will conduct a survey through the CATEI (Course and Teaching Evaluation and Improvement) process at the end of session to obtain feedback on the quality of the various course components. Your participation in the survey will be greatly appreciated. Students are also encouraged to provide informal feedback during the session, and to notify the lecturer-in-charge of any problems as soon as they arise.
Last year students noted that the online lectures often ran over time and tutorials were not long enough to cover a good amount of material. We have increased the length of tutorials so that less time is needed in lectures to cover the material best learned in tutorials.
Resource created Wednesday 02 February 2022, 09:29:43 AM, last modified Monday 14 February 2022, 10:06:26 AM.