BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Limits of Computation: From a Programming Perspective

Limits of Computation: From a Programming Perspective

Limits of Computation: From a Programming Perspective
Stock photo: cover may vary

Limits of Computation: From a Programming Perspective Paperback - 2016

by Reus, Bernhard

Add to wish list
  • Used
  • Paperback

Description

Springer, 2016. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,650grams, ISBN:9783319278872
Ask the seller a question Add to wish list
A$65.73
A$26.78 Delivery to USA
Standard delivery: 7 to 20 days
More delivery options
Ships from Anybook.com (Lincolnshire, United Kingdom)

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

Biblio member since 2004

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.

Terms of Sale:

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.

Browse books from Anybook.com

Reader reviews for Limits of Computation: From a Programming Perspective

From the publisher

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.

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.

About the author

Dr. Bernhard Reus is a Senior Lecturer in the Department of Informatics at the University of Sussex, with 15 years experience in teaching computability and complexity.
tracking-