Computability, Complexity, and Languages

Fundamentals of Theoretical Computer Science

By: Martin Davis, Ron Sigal, Elaine J. Weyuker

Write A Review

eText | 1 January 2000 | Edition Number 2

At a Glance

ePUB
609 Pages

eText

$121.00

or 4 interest-free payments of $30.25 with

Instant online reading in your Booktopia eTextbook Library *

Read online on

Desktop

Tablet

Mobile

Not downloadable to your eReader or an app

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 is an introductory text that covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. - Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page. - The number of exercises included has more than tripled. - Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.