1. Tutorial 1, Thursday 01/03/2007. Handout, model answers. Four examples of identifying the language of a DFA and formally proving correctness.
  2. Tutorial 2, Thursday 08/03/2007. Handout, model answers. Four examples of constructing a DFA to recognise and proving correctness.
  3. Tutorial 3, Thursday 15/03/2007. Handout, model answers. Two examples of identifying the language of a Turing machine and proving correctness.
  4. Tutorial 4, Thursday 22/03/2007. Handout, model answers. Two examples of constructing a Turing machine to recognise a language and proving correctness.
  5. Tutorial 5, Thursday 29/03/2007. Assignment 1 question and answer.
  6. Tutorial 6, Thursday 5/04/2007. Assignment 1 solutions.
  7. Tutorial 7, Thursday 26/04/2007. Assignment 2 solutions.
  8. Tutorial 8, Wednesday 2/05/2007. Test preparation.
  9. Tutorial 9, Thursday 10/05/2007. Handout, model answers. Uncountability, diagonalisation, halting problem.
  10. Tutorial 10, Thursday 17/05/2007. Handout. P and NP.