| Management number | 219445826 | Release Date | 2026/05/03 | List Price | $14.31 | Model Number | 219445826 | ||
|---|---|---|---|---|---|---|---|---|---|
| Category | |||||||||
This is a text for a first undergraduate theory course in Computer Science. It covers Turing Machines and the definition of computability, unsolvable problems including the Halting problem, an introduction to languages and grammars, Finite State machines, and computational complexity including the P versus NP question. In addition, each chapter ends with some brief extra topics.The approach is mathematical with definitions and proofs. But the pedagogy is liberal, emphasizing naturalness and making connections with the experience that students bring to the course. This encourages them to be active learners and to reflect on the results.There are more than eight hundred exercises, many illustrations, and many links for further reading. It is supported by worked answers to the exercises, classroom projector slides, and a full electronic version, all freely downloadable. Read more
| ISBN13 | 979-8297514126 |
|---|---|
| Language | English |
| Publisher | Independently published |
| Dimensions | 7.5 x 1.01 x 9.25 inches |
| Item Weight | 2.09 pounds |
| Reading age | Baby - 18 years |
| Print length | 445 pages |
| Publication date | August 11, 2025 |
If you notice any omissions or errors in the product information on this page, please use the correction request form below.
Correction Request Form