Note: This is an archived Handbook entry from 2014.
|Dates & Locations:|| |
This subject is not offered in 2014.
|Time Commitment:||Contact Hours: 48 hours, comprising of two 1-hour lectures and one 2-hour workshop per week |
Total Time Commitment:
25 points of university-level mathematics.
|Recommended Background Knowledge:|| |
Basic proficiency in discrete mathematics and propositional logic.
|Non Allowed Subjects:|| |
433-330 Theory of Computation
|Core Participation Requirements:||
For the purposes of considering request for Reasonable Adjustments under the Disability Standards for Education (Cwth 2005), and Student Support and Engagement Policy, academic requirements for this subject are articulated in the Subject Overview, Learning Outcomes, Assessment and Generic Skills sections of this entry.
It is University policy to take all reasonable steps to minimise the impact of disability upon academic study, and reasonable adjustments will be made to enhance a student's participation in the University's programs. Students who feel their disability may impact on meeting the requirements of this subject are encouraged to discuss this matter with a Faculty Student Adviser and Student Equity and Disability Support: http://services.unimelb.edu.au/disability
At the heart of theoretical computer science are questions of both philosophical and practical importance. What does it mean for a problem to be solvable by computer? What are the limits of computability? Which types of problems can be solved efficiently? What are our options in the face of intractability? This subject covers such questions in the content of a wide-ranging exploration of the nexus between logic, complexity and algorithms, and examines many important (and sometimes surprising) results about the nature of computing.
Example of assignment
INTENDED LEARNING OUTCOMES (ILO)
On completion of this subject the student is expected to:
Hurdle requirement: To pass the subject, students must obtain at least:
Assessment addresses all Intended Learning Outcomes (ILOs)
|Prescribed Texts:|| |
Michael Sipser, "Introduction to the Theory of Computation", 3rd Edition.
|Breadth Options:|| |
This subject potentially can be taken as a breadth subject component for the following courses:
You should visit learn more about breadth subjects and read the breadth requirements for your degree, and should discuss your choice with your student adviser, before deciding on your subjects.
|Fees Information:||Subject EFTSL, Level, Discipline & Census Date|
On completion of this subject students should have developed the following skills:
LEARNING AND TEACHING METHODS
The subject involves two 1-hour lectures per week followed by a 2-hour workshop. Weekly tutorial problems are assigned. Both lectures and workshops are designed to be highly interactive, and the written assignments are designed to be challenging, so as to generate discussion. Although written assignments are submitted by students individually, in-plenum discussion of the problems is allowed, and encouraged.
INDICATIVE KEY LEARNING RESOURCES
The subject uses a state-of-the-art textbook. It offers access to visualisation tools (the JFLAP suite), an online discussion forum, and advance access to all teaching materials, including slides used in lectures.
CAREERS / INDUSTRY LINKS
A solid understanding of computability and complexity is essential for any research-oriented work in the computing industry and academia. A grounding in theory provides important conceptual tools that are used by theoreticians, computer scientists, and software engineering practitioners alike.
Computing and Software Systems |
Master of Engineering (Software with Business)
Download PDF version.