This unique book presents a comprehensive and rigorous treatment of the theory of computability which is introductory yet self-contained. It takes a novel approach by looking at the subject using computation models rather than a limitation orientation. Accompanying software simulations (on the World Wide Web) of almost all computational models are available for use in conjunction with the text, and numerous examples are provided on the Web in a user-friendly format. Its applications to computer science itself include interesting links to programming language theory, compiler design theory, and algorithm design. The software, numerous examples, and solutions make this book ideal for self-study by computer scientists and mathematicians alike.
Did you know you can trade in your old books for an Amazon.co.uk Gift Card to spend on the things you want? Visit the Books Trade-In Store for more details. Learn more. |
Book Description
Product details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, and more.
Inside This Book
(Learn More)
First Sentence
The theory of computability is one of the newer branches of mathematics. Read the first page
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
The theory of computability is one of the newer branches of mathematics. Read the first page
Explore More
Concordance
Browse Sample PagesConcordance
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Reviews
There are no customer reviews yet on Amazon.co.uk.
5 star
4 star
3 star
2 star
1 star
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com:
4.0 out of 5 stars
6 reviews
14 of 14 people found the following review helpful
5.0 out of 5 stars
Unusually readable textbook on the theory of computing
8 Jan 2000
By Nancy Tinkham
- Published on Amazon.com
Format:Hardcover
The theory of computing can be a difficult subject to master, because of the densely symbolic notation and the mathematical complexity of the concepts. When I was a graduate student preparing for the theory portion of my exams, I remember being dismayed at the choice of textbooks that was available at the time: most simply threw a collection of Greek letters and subscripts at the reader, with little attempt to provide simply-worded explanations that would give the reader an intuition for the concepts.
Now that I am teaching the theory of computing, I want to provide my students with the best textbook I can find.
Two years ago, I was delighted to find R. Gregory Taylor's new book, "Models of Computation and Formal Languages". This is by far one of the most readable theory textbooks I have encountered. One of the features that caught my eye when I first examined the book was that many of the complicated symbolic expressions are accompanied by little explanatory text boxes with arrows that point to a symbol in the expression and explain the symbol that the arrow points to. I do this in class when I am lecturing -- I point to various symbols and explain where they came from, sometimes jotting down notes on the board alongside the symbols -- but this is the first time I have seen this technique in a textbook.
The writing style of the book is also fairly friendly and informal, without compromising mathematical precision.
The coverage of Turing-equivalent computing models is broader than in most introductory theory books; Taylor includes chapters not only on Turing Machines, but also on Recursive Function Theory, Markov Algorithms, Register Machines, Post Systems, and a model of parallel computation. Additionally, most chapters end with a proof that the model presented in that chapter is computationally equivalent to Turing Machines; thus, by the time the Church-Turing thesis is introduced in chapter 8, the reader is well prepared to entertain the claim that all of these models are capturing the same basic notion of an "algorithm".
I highly recommend this book to readers who want a readable introduction to computability theory.
3 of 4 people found the following review helpful
5.0 out of 5 stars
Difficult subject, yes, but very readable book
18 Jan 2000
By Anthony Mendoza
- Published on Amazon.com
Format:Hardcover
I was a bit taken aback by the "reader from United States" who gave this book only one star. The subject is difficult so the book is difficult. The book is as readable as possible given the subject matter. As Albert E. once said, "As simple as possible, but no simpler". This book strikes that balance.
0 of 2 people found the following review helpful
5.0 out of 5 stars
This is a very readable book
22 April 2002
By A Customer
- Published on Amazon.com
Format:Hardcover
I read this book. This is an excellent book for understanding
a complex subject.
a complex subject.
›
Go to Amazon.com to see all 6 reviews
4.0 out of 5 stars
Were these reviews helpful?
Let us know
Listmania!
Look for similar items by category
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
