Zucker, J; Pretorius, L
(South African Computer Society (SAICSIT), 1993)
These are notes for a short introductory course on Computability Theory (or recursive function theory). The basic notion of computability is defined in terms of a simple imperative programming language.