Skip to content

Opening book details…

Can I read Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) on EtoBox?

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) by Martin D. Davis; Ron Sigal; Elaine J. Weyuker is a nonfiction available to read on EtoBox.

What is Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) about?

This introductory text 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.<br><br>* 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.<br>* The number of exercises included has more than tripled.<br>* Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.

Who reads Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)?

It is typically read by self-directed learners exploring a subject in depth.

Common subject areas: history, science, philosophy, social sciences.

Author
Martin D. Davis; Ron Sigal; Elaine J. Weyuker
Publisher
Morgan Kaufmann Publishers
Published
1994
Language
EN
ISBN
9780080502465
Category
nonfiction
Subjects
Language Learning, Mathematics, Computer Science

Other editions & translations

More by Martin D. Davis; Ron Sigal; Elaine J. Weyuker

Browse all works by Martin D. Davis; Ron Sigal; Elaine J. Weyuker

Similar books