Computability and Unsolvability / Davis, Prof. Martin

"A clearly written, well-presented survey of an intriguing subject." — Scientific American. Classic text considers general theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, computable functionals, classification of unsolvable decision problems and more.