Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)
Product details
| Management number | 231816037 | Release Date | 2026/06/18 | List Price | $16.00 | Model Number | 231816037 | ||
|---|---|---|---|---|---|---|---|---|---|
| Category | |||||||||
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 more
| ASIN | B00BF9FK28 |
|---|---|
| XRay | Not Enabled |
| ISBN13 | 978-0080502465 |
| Edition | 2nd |
| Language | English |
| File size | 32.3 MB |
| Page Flip | Enabled |
| Publisher | Morgan Kaufmann |
| Word Wise | Not Enabled |
| Print length | 609 pages |
| Accessibility | Learn more |
| Screen Reader | Supported |
| Part of series | Computer Science and Scientific Computing |
| Publication date | March 18, 1994 |
| Enhanced typesetting | Enabled |
Bestseller ranking
Logic
Correction of product information
If you notice any omissions or errors in the product information on this page, please use the correction request form below.
Correction Request Form