Start reading Computability Theory: An Introduction to Recursion Theory on your Kindle in under a minute. Don't have a Kindle? Get your Kindle here or start reading now with a free Kindle Reading App.

Deliver to your Kindle or other device

 
 
 

Try it free

Sample the beginning of this book for free

Deliver to your Kindle or other device

Anybody can read Kindle books—even without a Kindle device—with the FREE Kindle app for smartphones, tablets and computers.
Computability Theory: An Introduction to Recursion Theory
 
 

Computability Theory: An Introduction to Recursion Theory [Kindle Edition]

Herbert B. Enderton

Print List Price: £48.99
Kindle Price: £42.49 includes VAT* & free wireless delivery via Amazon Whispernet
You Save: £6.50 (13%)
* Unlike print books, digital books are subject to VAT.

Formats

Amazon Price New from Used from
Kindle Edition £42.49  
Hardcover £44.73  
Kindle Daily Deal
Kindle Daily Deal: At least 60% off
Each day we unveil a new book deal at a specially discounted price--for that day only. Learn more about the Kindle Daily Deal or sign up for the Kindle Daily Deal Newsletter to receive free e-mail notifications about each day's deal.


Product Description

Review

"This textbook on basic computability theory is at the upper-undergraduate level."--Zentralblatt MATH 2012-1243-03057 "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

Product Description

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  


Product details

  • Format: Kindle Edition
  • File Size: 2275 KB
  • Print Length: 192 pages
  • Publisher: Academic Press; 1 edition (30 Dec 2010)
  • Sold by: Amazon Media EU S.à r.l.
  • Language: English
  • ASIN: B00512Q330
  • Text-to-Speech: Enabled
  • X-Ray:
  • Amazon Bestsellers Rank: #1,008,490 Paid in Kindle Store (See Top 100 Paid in Kindle Store)
  •  Would you like to give feedback on images?


More About the Author

Discover books, learn about writers, and more.

Customer Reviews

There are no customer reviews yet on Amazon.co.uk.
5 star
4 star
3 star
2 star
1 star
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com: 3.0 out of 5 stars  1 review
8 of 11 people found the following review helpful
3.0 out of 5 stars Mistakes 11 Feb 2011
By James Richwine - Published on Amazon.com
Format:Hardcover|Verified Purchase
I like Enderton's style, which is why I purchased his Computability text, but as it is a first edition, there are MANY mistakes in the text that I have seen so far and I am only on the second chapter. A lot of them are in examples and make the math more difficult to understand. Other than that, computability is an awesome subject, so there isn't much bad that can be said.
Was this review helpful?   Let us know

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 

Search Customer Discussions
Search all Amazon discussions
   


Look for similar items by category