Martin Davis
Computability, Complexity, and Languages
Fundamentals of Theoretical Computer Science
Ebook (EPUB Format)
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 f…
Mehr
Beschreibung
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.
CHF 52.90
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
Versandkostenfrei
Produktdetails
Weitere Autoren: Sigal, Ron / Weyuker, Elaine J.
- ISBN: 978-0-08-050246-5
- EAN: 9780080502465
- Produktnummer: 35977220
- Verlag: Elsevier Science & Techn.
- Sprache: Englisch
- Erscheinungsjahr: 1994
- Seitenangabe: 609 S.
- Plattform: EPUB
- Auflage: 2. Auflage
Über den Autor
Born in New York City in 1928, Martin Davis was a student of Emil L. Post at City College and his doctorate at Princeton in 1950 was under the supervision of Alonzo Church. Davis's book Computability and Unsolvability (1958) has been called one of the few real classics in computer science. He is best known for his pioneering work in automated deduction and for his contributions to the solution of Hilbert's tenth problem. For this latter work he was awarded the Chauvenet and Lester R. Ford Prizes by the Mathematical Association of America and the Leroy P. Steele Prize by the American Mathematical Society. In 1983 he was a Guggenheim Foundation Fellow and in 2005 he received the Herbrand Prize from the Conference on Automated Deduction. His books have been translated into a number of languages including Russian and Japanese. Davis has been on the faculty of the Courant Institute of Mathematical Sciences of New York University since 1965, was one of the charter members of the Computer Science Department founded in 1969, and is now Professor Emeritus. He is currently a Visiting Scholar at the University of California, Berkeley.
48 weitere Werke von Martin Davis:
Fundamentals of Theoretical Computer Science
Ebook (EPUB Format)
CHF 20.00
Fundamentals of Theoretical Computer Science
Ebook (EPUB Format)
CHF 18.70
Fundamentals of Theoretical Computer Science
Ebook (PDF Format)
CHF 141.50
Fundamentals of Theoretical Computer Science
Ebook (PDF Format)
CHF 193.50
Fundamentals of Theoretical Computer Science
Ebook (PDF Format)
CHF 70.90
Fundamentals of Theoretical Computer Science
Ebook (PDF Format)
CHF 106.50
Fundamentals of Theoretical Computer Science
Ebook (EPUB Format)
CHF 5.00
Fundamentals of Theoretical Computer Science
Ebook (PDF Format)
CHF 200.50
Fundamentals of Theoretical Computer Science
Ebook (EPUB Format)
CHF 14.20
Bewertungen
0 von 0 Bewertungen
Anmelden
Keine Bewertungen gefunden. Seien Sie der Erste und teilen Sie Ihre Erkenntnisse mit anderen.