Computability Theory: An Introduction to Recursion Theory
Language: English
Published by Academic Press, 2010
- Hardcover
- Used
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United KingdomPhatpocket Limited
AbeBooks seller since April 28, 2005
Condition: Used - Good
US$ 69.58
Quantity: 2 available
Add to basketItem description from seller
Seller Inventory # Z1-C-031-01817
- Title
- Computability Theory: An Introduction to Recursion Theory
- Author
- Enderton, Herbert B.
- Publisher
- Academic Press
- Publication year
- 2010
- Condition
- Good
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 0123849586
- ISBN 13
- 9780123849588
Computability Theory: An Introduction to Recursion Theory provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science. Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable way.
- Frequent historical information presented throughout
- More extensive motivation for each of the topics than other texts currently available
- Connects with topics not included in other textbooks, such as complexity theory
"Synopsis" may belong to another edition of this title.
Review
"...would benefit its target audience, especially now that a lot of mathematics courses eschew proofs...As with Enderton's well-known text in mathematical logic,...this is a thoughtfully written account of the basic facts, and I for one will likely use it in the future." --Mathematical Reviews, Computability Theory
"This textbook on basic computability theory is at the upper-undergraduate level." --Zentralblatt MATH, 2012
"Enderton (U. of California, Los Angeles) has written a clear, focused, and surprisingly literate textbook ― it is a rare mathematician who is this adept with words ― describing the history and theory of recursion theory that will be ideal for one-semester advanced courses in mathematics and computer science. After the concepts and theories are introduced, the equivalence of computable partial function and recursive partial function are demonstrated, in part through proofs of the unsolvability of the halting problem and of the enumeration theorem. Other chapters describe the properties of recursively enumerable sets, the link between computability theory and Gödel's incompleteness theorem, relative computability and degrees of unsolvability, and polynomial time computability. Appendices are included on Mathspeak, countability, and decadic notation." --SciTechBookNews
"Computability is concerned with the question of what computers can do in principle. Since Enderton directly contributed to the very areas that this book covers (computability and computational complexity), he is able to provide a concise and comprehensive firsthand view on the subject. As a scholar in the field, as well as in the history of logic, he frequently includes historical passages when presenting new concepts in the book.... This is a beautifully written and beautifully printed book.... The book fits perfectly as a textbook, covering standard material for one- or two-semester courses in computability or recursion theory. It is also an excellent study guide and reference for students and researchers in related areas. It is a lovely, short book that contains great ideas." --Computing Reviews
"About the title" may belong to another edition of this title.
Phatpocket Limited
Waltham Abbey, HERTS, United Kingdom
AbeBooks seller since April 28, 2005
Shipping rates from United Kingdom to U.S.A.
| Item | 5 to 19 business days | 1 to 3 business days |
|---|---|---|
| First item | US$ 14.38 | US$ 36.46 |
Payment methods
Store description
Specialty
Used books, Used textbooksSeller's business information
Phatpocket Limited
67 Newland Street
Witham, United Kingdom CM8 1AA
Terms of sale
Books are usually shipped within two working days. All of our books have a 14 or 30 day no hassle money back guarantee unless stated otherwise in the book's description. Item must be returned in the exact same condition that it was received. Through our work with The Rainbow Centre and other Charity Partners, we have already given hundreds of young people in Sri Lanka and Africa the vital chance to get an education.
Your satisfaction is extremely important to us and we would be happy to work with you to try and resolve any issues with your order. Please contact us via the Abe messaging centre regarding any problems and we will respond asap.
Please kindly send any return requests or reports of defects, damage, or material differences within 7 days of receipt of your order or 30 days from the date of shipment.
If you are making a return we will need to receive the item within 30 days from the date of shipment for UK orders or 90 days from the date of shipment for international orders. Similarly, we require that non-deliveries be reported within 30 days from the date of shipment for UK orders or 90 days from the date of shipment for international orders.
If your parcel is returned by the postal service due to being unclaimed, refused, or having an undeliverable or insufficient address, we will contact you to try and resolve the issue. If this is not possible, or if we do not hear back, we will refund you the cost of your order minus the original postage paid.
Shipping terms
Orders usually ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.
In spite of our best efforts, a small number of the items in our catalogue may be mispriced or out of stock. If an item's correct price is higher than our stated price, we will, at our discretion, either contact you for instructions before shipping or cancel your order and notify you of such cancellation.