|By Subject > Science and Mathematics > Computer Science and Operations Research > 3 > Mathematical Theory of Computation|
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.
|Mathematical Theory of Computation|
|Contents:||Click to View|
|Dimensions:||5 3/8 x 8 1/2|
Unabridged republication of the edition published by McGraw-Hill, New York, 1974.
|Ready to Buy?|
Add this to your cart
(you can always remove it later.)
Shopping here is Guaranteed Safe!
|Here's a sample of other Dover titles that may interest your customers.|
|Computability and Unsolvability|
by Prof. Martin Davis
Classic graduate-level introduction to theory of computability. Discusses general theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, more. read more
|Algorithms for Minimization Without Derivatives|
by Richard P. Brent
Outstanding text for graduate students and researchers proposes improvements to existing algorithms, extends their related mathematical theories, and offers details on new algorithms for approximating local and global minima. 1973 edition. read more
|Real Computing Made Real: Preventing Errors in Scientific and Engineering Calculations|
by Forman S. Acton
This concise guide to trouble-shooting offers practical advice on detecting and removing the bugs, preserving significant figures, avoiding extraneous solutions, and finding efficient iterative processes for solving nonlinear equations. 1996 edition.