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.
"synopsis" may belong to another edition of this title.
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.
Ron Sigal is an independently employed software developer who has held positions at Yale University, Lafayette College, Hofstra University, and the University of Catania in Italy. He has a PhD in computer science and has published in the areas of mathematical logic, robotics, and programming languages.
Elaine Weyuker is a researcher at AT&T Labs who specializes in empirical software engineering and testing research. She is a member of the National Academy of Engineering, an IEEE Fellow, an ACM Fellow, and an AT&T Fellow. She is the co-chair of the ACM Committee on Women in Computing (ACM-W) and a member of the Coalition to Diversify Computing's steering committee. She was the 2004 recipient of the Harlan D. Mills Award, the Rutgers University 50th Anniversary Outstanding Alumni Award, and the AT&T Chairman's Diversity Award. Before moving to AT&T, she was a computer science professor at the Courant Institute of Mathematical Sciences of NYU.
This book is a rigorous but readable introduction to some of the central topics in theoretical computer science. The main subjects are computability theory, formal languages, logic and automated deduction, computational complexity (including NP-completeness), and programming language semantics.
"About this title" may belong to another edition of this title.
£ 8.85 shipping from U.S.A. to United Kingdom
Destination, rates & speedsSeller: -OnTimeBooks-, Phoenix, AZ, U.S.A.
Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if youâre not satisfied with purchase please return item for full refund. Ships via media mail. Seller Inventory # OTV.0122063821.G
Quantity: 1 available
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1100grams, ISBN:9780122063824. Seller Inventory # 5845468
Quantity: 1 available
Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Hardcover. Condition: Good. No Jacket. Former library book; Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 2.3. Seller Inventory # G0122063821I3N10
Quantity: 1 available
Seller: Friends of Johnson County Library, Lenexa, KS, U.S.A.
Condition: Good. Hardcover book. The exterior can have some minor wear. Dust jacket shows only light wear. The pages appear to be clean and unmarked. All items ship Monday - Saturday - Fast Shipping in a secure package. Your purchase will help support the programs and collections of the Johnson County (Kansas) Library. Seller Inventory # 53DTTR000R2G
Quantity: 1 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers. Seller Inventory # 494522-5
Quantity: 4 available
Seller: Chiron Media, Wallingford, United Kingdom
Hardcover. Condition: New. Seller Inventory # 6666-ELS-9780122063824
Quantity: Over 20 available
Seller: Brook Bookstore On Demand, Napoli, NA, Italy
Condition: new. Questo è un articolo print on demand. Seller Inventory # 87a1d7b94dac3bdef3f745e7c641e4fa
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers. Seller Inventory # 494522-5
Quantity: 4 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. Englisch. Seller Inventory # 9780122063824
Quantity: 2 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. pp. 630 54:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Blue Cloth w/Jacket on White w/Gloss Lam. Seller Inventory # 7082057
Quantity: 3 available