Mathematical Foundations of Computer Science
- Professor Cristian S. Calude,
room 303-575, Science Building, course coordinator.
- Professor Fred Kroon,
18 Symonds St.,
Noreen Jamil. Office hours:
By appointment, room 303-475. Any problem
related to marking should be addressed to the tutor.
To be elected.
- Taught: First semester 2014, three hours of lectures and a tutorial a week (see 2014 Academic Dates).
Timetable: Lectures: Tuesday 16-17, Science Center, 303-101, Thursday 15-16, Arts 1/209, Friday 15-16, Arts 1/209. Tutorial: Tuesday 17-18, Biology Building/100, starting the second
week. In the weeks 3-6, Lectures: Tuesday 16-17, Science Center, 303-101, Thursday 15-16, Tuesday 17-18, Biology Building/100. Tutorial: Friday 15-16, Arts 1/209.
Check updates at COMPSCI Timetable.
- Short Description:
The aim of this paper is to present mathematical models for computers and
computation, and derive results about what can and cannot be computed. It
deals with idealised computers (automata) which operate on idealised input
and output (formal languages). For example, we prove that it is impossible
to write a computer program that takes as input any computer program and
tells us whether or not that program will end up in an endless loop (the
Quantum computing will also be briefly described and the Church-Turing Thesis will be critically discussed. In addition we will discuss some problems in algorithmic complexity.
We assume you are comfortable with formal mathematical proofs and can write them
- Automata and regular languages
- Computability and decidability
- Algorithmic complexity
- Church-Turing Thesis
- Quantum computing
- Expected learning outcomes: On completion, students will be able to
- explain the theoretical limits on computational solutions of undecidable and inherently complex problems
- describe concrete examples of computationally undecidable or inherently infeasible problems from different fields
- understand formal definitions of machine models, classical and unconventional
- prove the undecidability or complexity of a variety of problems
- understand the issue of whether there are limits of computability
Introduction to the Theory of
PWS Publishing Company, Boston, 2013, third edition.
- Software: Register machine simulation
- Tutorials: Materials will be available on Cecil.
- Assessment: Three assignments worth 20% in total, Test: 30%, Exam: 50%
- Assignments (the assignment dropbox will be outside the room 303-576): Assignment 1:
due Monday 7 April, before 4.00pm,
due Monday 19 May, before 4.00pm,
due Friday 6 June, before 4.00pm, worth 6%.
Sample solutions: Assignment 1.
Tuesday 29 April, in class.Test preparation.
- Handouts (subject to changes):
Part 1, Prof. Calude's lectures. Part 3, Prof. Calude's lectures.
- Policy on
- Other relevant sites: