Computation Theory Lecture notes by Prof Anuj Dawar
File Type :Online Number of Pages :93
Description The aim of this course note
is to introduce several apparently different formalisations of the informal
notion of algorithm; to show that they are equivalent; and to use them to
demonstrate that there are incomputable functions and algorithmically
undecidable problems.
