Limits of Computation: From a Programming Perspective

Author:   Bernhard Reus
Publisher:   Springer International Publishing AG
Edition:   1st ed. 2016
ISBN:  

9783319278872


Pages:   348
Publication Date:   04 April 2016
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $158.37 Quantity:  
Add to Cart

Share |

Limits of Computation: From a Programming Perspective


Add your own review!

Overview

Full Product Details

Author:   Bernhard Reus
Publisher:   Springer International Publishing AG
Imprint:   Springer International Publishing AG
Edition:   1st ed. 2016
Dimensions:   Width: 15.50cm , Height: 1.90cm , Length: 23.50cm
Weight:   6.232kg
ISBN:  

9783319278872


ISBN 10:   3319278878
Pages:   348
Publication Date:   04 April 2016
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

"Foreword.- Limits? What Limits?.- Part I Computability.- Problems and Effective Procedures.- The WHILE-Language.- Semantics of WHILE.- Extensions of WHILE.- Programs As Data Objects.- A Self-Interpreter for WHILE.- An Undecidable (Non-computable) Problem.- More Undecidable Problems.- Self-referencing Programs.- The Church-Turing Thesis.- Part II Complexity.- Measuring Time Usage.- Complexity Classes.- Robustness of P.- Hierarchy Theorems.- Famous Problems in P.- Common Problems not Known to be in P.- The One-Million-Dollar Question.- How Hard is a Problem?.- Complete Problems.- How to Solve NP-complete Problems?.- Part III Emerging New Models of Computation - ""going nano"".- Molecular Computing.- Quantum Computing.- Appendix A: Further Reading - Computability and Complexity Textbooks.- Glossary.- Index."

Reviews

The book under review is a textbook intended to provide the material for an introductory course on the classic theory of algorithms and modern complexity theory for senior undergraduate computer science students. ... the book is a good, concise introduction to the fields of computability and complexity for students, and a good reference for working professionals in all areas of computer science and mathematics. (M. I. Dekhtyar, Mathematical Reviews, November, 2016)


Author Information

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. 

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List