Jump to ratings and reviews
Rate this book

Mathematical Theory of Computation

Rate this book
With the objective of making into a science the art of verifying computer programs (debugging), the author addresses both practical and theoretical aspects. Subjects include computability (with discussions of finite automata and Turing machines); predicate calculus; verification of programs (bloth flowchart and algol-like programs); flowchart schemas; and the fixpoint theory of programs. 1974 edition. Includes 77 figures.

448 pages, Hardcover

First published November 1, 1974

3 people are currently reading
29 people want to read

About the author

Zohar Manna

35 books2 followers

Ratings & Reviews

What do you think?
Rate this book

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
1 (12%)
4 stars
3 (37%)
3 stars
4 (50%)
2 stars
0 (0%)
1 star
0 (0%)
Displaying 1 of 1 review
Profile Image for William Schram.
2,401 reviews99 followers
August 24, 2023
The Mathematical Theory of Computation by Zohar Manna is a perennial computer science classic. The book predates several advances in the field since they published it in 1974. However, the book lays a foundational groundwork for computer science that is still functional. Manna calls the book an introductory text, and we will evaluate that statement.

Author Zohar Manna was from Haifa, Israel. He received his Bachelor of Science in Electrical Engineering from the Israel Institute of Technology in 1961 and furthered his studies at Stanford University. Manna's work focused on formal methods, where he pioneered techniques for verifying software using mathematical logic. Although Manna is no longer with us, his legacy lives on in his work.

My understanding of the field is limited. I never took formal courses in computer science, and I don't remember reading anything on the subject before. You may correct me if I am wrong. I do know that 1974 was a busy year for computer science. The nascent field was expanding at a rapid rate. I imagine Manna had trouble deciding what to exclude from the book. Furthermore, before the 1970s, computer science wasn't separate from mathematics or engineering.

Manna opens the book with a discussion on what is computable. Alan Turing and several others wrote academic papers on the subject. Turing posited a general computing machine capable of implementing any computer algorithm. We call this theoretical construct a Turing Machine.

The author calls this an introductory text, and I agree. Manna explains all of the terms and jargon he uses in the book. The book has five chapters. Computability, Predicate Calculus, Verification of Programs, Flowchart Schemas, and The Fixpoint Theory of Programs are all covered. Each chapter has a section devoted to references used.

I enjoyed the book. Thanks for reading my review, and see you next time.
Displaying 1 of 1 review

Can't find what you're looking for?

Get help and learn more about the design.