Limits of Computation: From a Programming Perspective Paperback - 2016
by Reus, Bernhard
- Used
- Paperback
Standard delivery: 7 to 20 days
Details
- Title Limits of Computation: From a Programming Perspective
- Author Reus, Bernhard
- Binding Paperback
- Pages 348
- Volumes 1
- Language ENG
- Publisher Springer
- Publication date 2016
- Bookseller's Inventory # 3977649
- ISBN 9783319278872 / 3319278878
- Weight 13.74 lbs (6.23 kg)
- Dimensions 9.25 x 6.1 x 0.76 in (23.50 x 15.49 x 1.93 cm)
- Category Computers - Languages / Programming
- Dewey Decimal Code 005.1
About Anybook.com Lincolnshire, United Kingdom
Established in 1998 Anybook.com. has sold millions of scholastic books to university libraries, academics, students and reflective bibliophiles throughout the world. As the majority of our books are ex-library they are well bound, in good, clean condition and ideally suited for study and research. Our books cover a huge range of academic disciplines from Mathematics, Science and Philosophy to Art and Literature as well as many works in other European languages.
Based in central Lincoln, Anybook.com. sells exclusively online. We specialise in academic works. All our books are in good condition or better, unless otherwise described. All the books we have on sale are to hand in our warehouses in Lincoln. Photographs and additional information on request. Books out within 1 working day. We use reputable couriers at greatly discounted postage rates. As well as Visa and Mastercard, we also accept Switch, Discover and Solo. We also accept Paypal (www.paypal.com) payments. Other methods of payment are possible but please email us for details. Remember if you are unsatisfied in any way with any purchase, we will give you a complete and unconditional refund. E-mail us if you have any questions about the service we offer. Please be aware our prices and shipping costs do not include local import taxes which may need to be paid by the customer upon receipt.
Reader reviews for Limits of Computation: From a Programming Perspective
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
From the rear cover
This textbook discusses the most fundamental and puzzling questions about the foundations of computing. In 23 lecture-sized chapters it provides an exciting tour through the most important results in the field of computability and time complexity, including the Halting Problem, Rice's Theorem, Kleene's Recursion Theorem, the Church-Turing Thesis, Hierarchy Theorems, and Cook-Levin's Theorem. Each chapter contains classroom-tested material, including examples and exercises. Links between adjacent chapters provide a coherent narrative.
Fundamental results are explained lucidly by means of programs written in a simple, high-level imperative programming language, which only requires basic mathematical knowledge. Throughout the book, the impact of the presented results on the entire field of computer science is emphasised. Examples range from program analysis to networking, from database programming to popular games and puzzles. Numerous biographical footnotes about the famous scientists who developed the subject are also included.
"Limits of Computation" offers a thorough, yet accessible, introduction to computability and complexity for the computer science student of the 21st century.