Henry Hamburger – författare

This unique compendium highlights the theory of computation, particularly logic and automata theory. Special emphasis is on computer science applications including loop invariants, program correctness, logic programming and algorithmic proof techniques.This innovative volume differs from standard textbooks, by building on concepts in a different order, using fewer theorems with simpler proofs. It has added many new examples, problems and answers. It can be used as an undergraduate text at most universities.

This text presents the formal concepts underlying Computer Science.It starts with a wide introduction to Logic with an emphasis on reasoning and proof, with chapters on Program Verification and Prolog.The treatment of computability with Automata and Formal Languages stands out in several ways:it emphasizes the algorithmic nature of the proofs and the reliance on simulations;;it stresses the centrality of nondeterminism in generative models and the relationship to deterministic recognition models;The style is appropriate for both undergraduate and graduate classes.