Sitewide Free Shipping - Limited Time Only - No Minimum Spend - T&C's Apply
Track My Order
Help Centre
Likes
My Wish ListsLogin / Join
Booktopia
Australia's local bookstore
Get Free Shipping on orders over $0
Computability, Complexity, and Languages : Fundamentals of Theoretical Computer Science - Martin D. Davis

Computability, Complexity, and Languages

Fundamentals of Theoretical Computer Science

By: Martin D. Davis, Elaine J. Weyuker

eText | 10 May 2014 | Edition Number 1

At a Glance

eText

$89.10

or 4 interest-free payments of $22.27 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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.
on
Desktop
Tablet
Mobile

You Can Find This eBook In

Non-FictionReference, Information & Interdisciplinary SubjectsEncyclopaedias & Reference WorksReference WorksMathematicsMathematical FoundationMathematical Logic

More in Reference Works

Spotless A-Z - Jennifer Fleming

eBOOK

Spotless A-Z

eBook

$10.99

The Jewish Wedding Now - Anita Diamant

eBOOK

The Jewish Wedding Now

eBook

$11.99

The Words We Live By - Brian Burrell

eBOOK

The Words We Live By

eBook

$18.99

This product is categorised by