Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Elements of computation theory
Singh A., Springer Publishing Company, Incorporated, New York, NY, 2009. 422 pp. Type: Book (9781848824966)
Date Reviewed: Oct 19 2009

This undergraduate textbook is designed for a course on the foundations of computer science (CS). Teaching such a course can be a challenging enterprise. Many students believe that what they learn in such a foundational course has nothing to do with their future work and, as a result, show little motivation and interest. To help with this difficult situation, instructors require motivational textbooks that are as clear and precise as possible. While this is difficult to achieve, undergraduate theory textbooks should be measured by this criteria.

CS foundational material undergoes very few changes. Hence, for a textbook to be helpful to an instructor, it should provide additional tools to help the instructor connect the material with recent developments in the field. Unfortunately, this textbook fails in this respect. While it is well written and easy to understand, it contains little else than a nice collection of theorems, proofs, and exercises that CS students are expected to know and/or know how to solve.

The book is divided into ten chapters, and each chapter is divided into several sections. The sections are relatively short, making them suitable for a one- or two-hour lesson plan.

The book follows a standard outline. Chapter 1 is “Mathematical Preliminaries.” Chapter 2 is “Regular Languages.” Chapter 3 handles equivalences between languages. Chapter 4 is “Structure of Regular Languages.” Chapter 5 is “Context-free Languages,” and chapter 6 discusses their properties. Chapter 7 and 8 deal with computably enumerable and noncomputably enumerable languages, respectively. Chapter 9 is “Algorithmic Solvability,” and chapter 10 is “Computational Complexity.” Due to chapter 10’s brevity, it seems to shortchange its difficult subject. Since it is very dense, it will be of limited value to many readers.

Overall, I recommend this book to instructors and students who are only looking for a clear, concise, and well-written introduction to the foundations of CS. However, the book does not encourage readers’ interest in the subject, if the motivation is not already there.

Reviewer:  Burkhard Englert Review #: CR137378 (1009-0869)
Bookmark and Share
  Featured Reviewer  
 
General (F.1.0 )
 
 
Formal Languages (F.4.3 )
 
 
Models Of Computation (F.1.1 )
 
Would you recommend this review?
yes
no
Other reviews under "General": Date
Fundamental physical limitations of the computational process
Landauer R.  Computer culture: the scientific, intellectual, and social impact of the computer (, New York,1701984. Type: Proceedings
Feb 1 1987
Combinatorics, complexity, and randomness
Karp R. Communications of the ACM 29(2): 98-109, 1986. Type: Article
Oct 1 1986
A recursive introduction to the theory of computation
Smith C., Springer-Verlag New York, Inc., Secaucus, NJ, 1994. Type: Book (9780387943329)
Nov 1 1996
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy