Computability theory: an introduction

by Neil D. Jones

Computability An Introduction provides information pertinent to the major concepts, constructions, and theorems of the elementary theory of computability of recursive functions. This book provides mathematical evidence for the validity of the Church–Turing thesis.
Organized into six chapters, this book begins with an overview of the concept of effective process so that a clear understanding of the effective computability of partial and total functions is obtained. This text then introduces a formal development of the equivalence of Turing machine computability, enumerability, and decidability with other formulations. Other chapters consider the formulas of the predicate calculus, systems of recursion equations, and Post's production systems. This book discusses as well the fundamental properties of the partial recursive functions and the recursively enumerable sets. The final chapter deals with different formulations of the basic ideas of computability that are equivalent to Turing-computability.
This book is a valuable resource for undergraduate or graduate students.

154 pages, Hardcover

Published June 1, 1973