This book introduces the major concepts, constructions, and theorems of the elementary theory of computability of recursive functions. It emphasizes the concept of "effective process" early in order to provide a clear, intuitive understanding of effective computability (as related to functions and sets) before proceeding to the rigorous portion of the book. Subsequent chapters present a formal development of the equivalence of Turing machine computability, enumerability, and decidability with other formulations of the concepts, including systems of recursion equations and post's production systems.
"synopsis" may belong to another edition of this title.
Book Description Academic Press Inc. Hardcover. Book Condition: New. 0123900506 New Condition. Bookseller Inventory # NEW6.1037280
Book Description Academic Press Inc, 1973. Hardcover. Book Condition: New. Bookseller Inventory # DADAX0123900506