Institutional Subscription

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping No minimum order.

Description

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science provides an introduction to the various aspects of theoretical computer science. Theoretical computer science is the mathematical study of models of computation.

This text is composed of five parts encompassing 17 chapters, and begins with an introduction to the use of proofs in mathematics and the development of computability theory in the context of an extremely simple abstract programming language. The succeeding parts demonstrate the performance of abstract programming language using a macro expansion technique, along with presentations of the regular and context-free languages. Other parts deal with the aspects of logic that are important for computer science and the important theory of computational complexity, as well as the theory of NP-completeness. The closing part introduces the advanced recursion and polynomial-time computability theories, including the priority constructions for recursively enumerable Turing degrees.

This book is intended primarily for undergraduate and graduate mathematics students.

Martin D. Davis

Elaine J. Weyuker

About the Editor

Werner Rheinboldt

Ratings and Reviews

Review's title & body can't be emptyPlease enter a star rating for this reviewName field cannot be emptyInvalid emailYour review has already been submitted.Max length was exceededPlease fill out all of the mandatory (*) fieldsOne or more of your answers does not meet the required criteria