Learn more Shop now Shop now Shop now Shop now Shop now Learn More Shop now Learn more Fire Kids Edition Shop Kindle Learn More Shop now Shop now
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

Sorry, this item is not available in
Image not available for
Colour:
Image not available
 

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

Herbert B. Enderton

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

Free Kindle Reading App Anybody can read Kindle books—even without a Kindle device—with the FREE Kindle app for smartphones, tablets and computers.

To get the free app, enter your mobile phone number.

Formats

Amazon Price New from Used from
Kindle Edition £44.63  
Hardcover £48.99  
Paperback £48.99  
Kindle Daily Deal
Kindle Daily Deals: Books from 99p
Sign-up to the Kindle Daily Deal email newsletter to discover daily deals from 99p.

Special Offers and Product Promotions

  • Get £1 to spend on Amazon Video when you buy any Kindle ebook. Offer ends at 23:59pm, 27 September, 2017. Terms and conditions apply. Click here for more details: http://www.amazon.co.uk/Instant-Video/b/ref=nav_shopall_aiv?ie=UTF8&node=11365403031 Here's how (terms and conditions apply)
Get a £1 credit for movies or TV
Enjoy £1.00 credit to spend on movies or TV on Amazon Video when you purchase any Amazon Kindle Book from the Kindle Store (excluding Kindle Unlimited, Periodicals and free Kindle Books) offered by Amazon.co.uk. A maximum of 1 credit per customer applies. UK customers only. Offer ends at 23:59 on Wednesday, September 27, 2017. Terms and conditions apply

Book 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 Description

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


Product details

  • Format: Kindle Edition
  • File Size: 3401 KB
  • Print Length: 193 pages
  • Page Numbers Source ISBN: 0123849586
  • 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:
  • Word Wise: Not Enabled
  • Enhanced Typesetting: Not Enabled
  • Amazon Bestsellers Rank: #1,609,588 Paid in Kindle Store (See Top 100 Paid in Kindle Store)
  •  Would you like to give feedback on images?


Customer Reviews

There are no customer reviews yet.
5 star
4 star
3 star
2 star
1 star

Look for similar items by category