Book of Donmon Teith

Provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory.

The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contr

Classic graduate-level introduction to theory of computability. Discusses general theory of computability, computable functions, operations on computable functi

Once we have accepted a precise replacement of the concept of algo rithm, it becomes possible to attempt the problem whether there exist well-defined collection

The task of developing algorithms to solve problems has always been considered by mathematicians to be an especially interesting and im portant one. Normally an