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

Skip to content

Limits of Computation

Limits of Computation

Limits of Computation
Stock photo: cover may vary

Limits of Computation Paperback - 2016

by Bernhard Reus

Add to wish list
  • New
New

Description

New/New. Brand New Original US Edition, Perfect Condition. Printed in English. Excellent Quality, Service and customer satisfaction guaranteed!
Ask the seller a question Add to wish list
A$86.02
A$21.71 Delivery to USA
Standard delivery: 7 to 14 days
More delivery options
Ships from Students Textbooks (India)

Details

  • Title Limits of Computation
  • Author Bernhard Reus
  • Binding Paperback
  • Condition New
  • Pages 348
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date 2016
  • Bookseller's Inventory # BIBNNA-25341
  • 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
  • Quantity available 2

About Students Textbooks India

Biblio member since 2009

Selling textbooks, International editions and reference books online from last 5 Years.

Terms of Sale:

30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged. Return address: Students_Textbooks 12 phankha road Jankpuri New Delhi 110036 India

Browse books from Students Textbooks

Reader reviews for Limits of Computation

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-