Course notes


140 logic


499 Modal and temporal logic


240 Computability, algorithms & complexity

Below are notes and exercises on a 20-lecture 2nd year undergraduate course on computability, algorithms, and complexity that I gave in the Department of Computing at Imperial College London from 1990-96 approx. The course is now given by others, the syllabus has changed, and I cannot get involved in it.

These notes are copyright Ian Hodkinson. However, all examination questions they contain are copyright University of London. You may use the notes so long as they are not sold for profit and my name appears on them as in the files.

1. Notes (2003): 168 pages, searchable .pdf file.

2. Ten sets of tutorial questions on the course. Solutions are available (to bona fide teachers outside this Department) from me at imh[please insert an at-sign here]doc.ic.ac.uk.
Current Imperial students should direct all queries about course materials, including requests for tutorial solutions, to the currect lecturer.