Computation Theory
Here is the pdf file of
the notes of Richard Crouch's second-year course at the University of Nottingham on
Languages, Computation and Automata. They do not correspond directly to any one 1B course here, but students might find them useful: they are very meaty.
Here are Frank Stephan's Notes on computation theory.
These, too, are meaty, and contain more material than CS 1B students
will need, but it's all good stuff.
There is a Part II Maths course in Languages and Automata which you
could look at. There is a considerable overlap between that course and
several CS courses — such as 1A Languages and Automata, 1B
Compilers and 1B Computation Theory. 1B CS students might find it
helpful, in that it not only covers some of the material in 1B CS
Computation Theory, but will help with revision for Languages and
Automata, Push-down automata, Context-free Languages and the like.
At this stage i can locate only
the example sheets ; if-and-when when i locate the lecturer's
notes i'll put a link here. I supervised the course for years, and
this blog grew out of my supervision notes. My
notes are a bit discursive but they contain a lot of material that
1B CS students may find helpful and stimulating. In particular they
contain discussions of several old CS Comp Th tripos questions.
Recently the course has been taken over by a new lecturer, and the
example sheets have changed quite a lot. However the old example
sheets (to which my file contains answers) are still linked from the
DPMMS site, and CS students would be advised to chew preferentially
on the older sheets.
I seem to have discussion answers to
2009 paper 6 question 3,
2015 paper 6 question 4,
2013 paper 6 question 4, and (another take on)
2015 paper 6 question 4.
Q 10 on Dr Griffin's example sheet concerns the subtle question of why
the Ackermann function is not primitive recursive even tho' its slices
are. Here is a discussion answer to
the last part.
Logic and Proof
Here are some assorted
questions on Logic and proof (mainly of my own devising) with
answers. It also contains assorted answers to old exam questions and
exercises in Prof. Paulson's notes.
Here is a two-page file on the use of the various arrow and turnstile symbols used in that course.
Here is a file of useful material on a unification algorithm .
Foundations of Functional Programming
Here are some discussions of old tripos questions in Foundations of Functional Programming .
They may be of interest to people doing Computation theory since they are largely about lambda calculus.
Materials for 1a Computer Science .
Materials for Part III Mathematics .
Materials for Logic-For-Linguists.
Materials for Part II Mathematics .
Materials for Part IV Mathematics .
Materials for the Computer Science M. Phil .