It’s important to note that the original 1974 edition is out of print, but you have legitimate options:
Rather than relying solely on machine states, Manna introduces the theory of recursive functions (μ-recursive functions). This approach characterizes computability through functional composition, primitive recursion, and minimization. This functional view is critical for understanding modern functional programming languages and the semantics of recursion.
The text expands on the work of C.A.R. Hoare, utilizing axiomatic semantics. By using notation such as $P S Q$ (if precondition $P$ holds, and statement $S$ executes, then postcondition $Q$ holds), Manna provides a calculus for reasoning about code. He demonstrates how to derive the weakest precondition necessary for a program segment to produce a desired result, a technique now standard in compiler optimization and automated theorem proving.
Zohar Manna's Mathematical Theory of Computation is a foundational text in computer science, originally published in 1974 by McGraw-Hill and later reprinted as a Dover edition. The book aims to transform the "art" of program verification (debugging) into a formal science. Access and Availability
Digital Copies: You can borrow or download digital versions through the Internet Archive. It’s important to note that the original 1974
Course Excerpts: Partial PDF documents and course materials related to the book are hosted by academic institutions like Cornell University.
Alternative Titles: For a more modern approach by the same author, see The Calculus of Computation (2007), which covers decision procedures and program verification. Core Subject Areas
The text provides a self-contained treatment of the following topics:
Computability: Detailed discussions on finite automata and Turing machines. The text expands on the work of C
Predicate Calculus: Covers basic logical notions, natural deduction, and the resolution method.
Program Verification: Formal methods for proving the correctness of both flowchart-style and Algol-like programs.
Flowchart Schemas: Analysis of decision problems and formalization within predicate calculus.
Fixpoint Theory: Exploration of functions, functionals, and recursive program verification. Bibliographic Details Original Publication: 1974. Reprint: Dover Publications, 2003. Pages: Approximately 448–480 pages. ISBN-13: 978-0486432380. Mathematical theory of computation : Manna, Zohar He demonstrates how to derive the weakest precondition
Mathematical theory of computation : Manna, Zohar : Free Download, Borrow, and Streaming : Internet Archive. Internet Archive MATHEMATICAL THEORY OF COMPUTATION
Title: Formalizing the Infinite: A Review and Modern Perspective on Zohar Manna’s Mathematical Theory of Computation
Abstract
Zohar Manna’s 1974 seminal work, Mathematical Theory of Computation, stands as a cornerstone in the foundation of computer science. While the search query suggests a desire for a "portable" (PDF/digital) format of this classic text, this paper aims to synthesize the core contributions of Manna’s work into a concise, accessible document. We explore the transition from informal algorithms to formal mathematical structures, the hierarchy of automata, and the fundamental concepts of computability and program verification. This paper serves as a "portable" summary of Manna’s dense theoretical framework, demonstrating its enduring relevance in modern software verification.