Fortæl dine venner om denne vare:
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Computer Science and Scientific Computing Davis, Martin (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.) 2. udgave
Pris
DKK 740
Bestilles fra fjernlager
Forventes klar til forsendelse 8. - 15. jan. 2026
Julegaver kan byttes frem til 31. januar
Tilføj til din iMusic ønskeseddel
eller
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Computer Science and Scientific Computing
Davis, Martin (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.)
Covers the key areas of computer science, including recursive function theory, formal languages, and automata. This book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. It also covers in a variety of different arrangements automata theory, computational logic, and complexity theory.
609 pages, further reading, index
| Medie | Bøger Hardcover bog (Bog med hård ryg og stift omslag) |
| Udgivet | 3. februar 1994 |
| ISBN13 | 9780122063824 |
| Forlag | Elsevier Science & Technology |
| Antal sider | 609 |
| Mål | 162 × 236 × 48 mm · 1,10 kg |