Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Hardcover

Davis, Martin

Hardcover

ISBN 10: 1493300342 ISBN 13: 9781493300341

Verlag: Morgan Kaufmann, 2015

Inhaltsangabe

This introductory text 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.

Über diesen Titel

Biografía del 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.

Details zur Ausgabe

• Verlag: Morgan Kaufmann
• Erscheinungsdatum: 2015
• ISBN 10: 1493300342
• ISBN 13: 9781493300341
• Einband: Tapa dura
• Sprache: Englisch
• Anzahl der Seiten: 632
• Kontakt zum Hersteller: Nicht verfügbar