31Y7 Computability Option
Some references you may find useful.
The recommended course text is
Fundamentals of the Theory of Computation, by Greenlaw and
Hoover. Library call number SC 2.6 GRE.
This is written for Computer Scientists, so should
appeal to your intuitions about programming, while also giving you the
technical knowledge you need.
There are lots of books on Computability around. Some are more
mathematical than others. Don't let that put you off the subject
completely! Just find a book which is more to your taste.
For less technical, more discursive material these two are very
- A First Course in Computability, Rayward-Smith. SC 2.6 RAY
- Computability and Logic, Boolos and Jeffrey. AQ 7 BOO
- Introduction to Automata Theory, Languages and Computation,
Hopcroft and Ullman. SC 2.5 HOP
- Computability, Cutland. S 4.6 CUT
- Algorithmics:the spirit of computing, Harel. SC 9.2 HAR
- Lectures on Computation, Feynman. SC 2.6 FEY (RBR)
Have a look yourself for pages on computability, but here are some
links on Turing machines, Turing, and other pioneers of computing:
Back to the 31Y7 home
Dr Carron Shankland
Last revision: 13th September 1999