Computability, Complexity, and Languages : Fundamentals of Theoretical Computer Science - Martin Davis

eBOOK

Computability, Complexity, and Languages

Fundamentals of Theoretical Computer Science

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

eBook | 1 January 2000 | Edition Number 2

At a Glance

eBook


RRP $110.00

$98.99

10%OFF

or 4 interest-free payments of $24.75 with

 or 

Instant Digital Delivery to your Booktopia Reader App

Read on
Android
eReader
Desktop
IOS
Windows

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.

Read on
Android
eReader
Desktop
IOS
Windows

More in Mathematics

Men of Mathematics - E.T. Bell

eBOOK

Is God a Mathematician? - Mario Livio

eBOOK

Basic Mathematics : Collins College Outlines - Lawrence A. Trivieri

eBOOK

X-Events : The Collapse of Everything - John L. Casti

eBOOK

RRP $24.19

$19.99

17%
OFF