Tipsa dina vänner om produkten:
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:a utgåva
Pris
SEK 909
Beställningsvara
Förväntad leverans 9 - 20 jan 2026
Julklappar kan bytas fram till 31:e januari
Lägg till din iMusic-önskelista
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
| Media | Böcker Inbunden Bok (Inbunden bok med hårda pärmar och skyddsomslag) |
| Releasedatum | 3 februari 1994 |
| ISBN13 | 9780122063824 |
| Utgivare | Elsevier Science & Technology |
| Antal sidor | 609 |
| Mått | 162 × 236 × 48 mm · 1,10 kg |