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.
Shipping:
US$ 10.47
From United Kingdom to U.S.A.
Seller: Better World Books Ltd, Dunfermline, United Kingdom
Condition: Good. 1st. Ships from the UK. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Seller Inventory # GRP63049852
Quantity: 1 available
Seller: Nelson & Nelson, Booksellers, Trenton, SC, U.S.A.
Hardcover. Condition: VG. Dust Jacket Condition: No Dust Jacket. Black cloth covers clean, bright; pages tight, unmarked, though paper a tad browned due to paper quality and age. No DJ. Not a former library copy; no underlining, etc. ; Seller Inventory # 34495
Quantity: 1 available