UPDF AI

Theories of computability

N. Pippenger

1997 · DBLP: books/daglib/0092426
118 Citations

TLDR

This authoritative account of the classical theory of computable functions and relations takes the form of a tour through basic recursive function theory, starting with an axiomatic foundation and developing the essential methods in order to survey the most memorable results of the field.