Description: Computability, Complexity, and Languages : Fundamentals of Theoretical Computer Science, Hardcover by Davis, Martin; Sigal, Ron; Weyuker, Elaine J., ISBN 0122063821, ISBN-13 9780122063824, Brand New, Free shipping in the US A rigorous but readable introduction to some of the central topics in theoretical computer science, including computability theory, formal languages, logic and automated deduction, computational complexity including NP-completeness, and programming language semantics. This second edition features more than triple the exercises of the previous edition and a new discussion of computability theory; a section on the denotational and operational semantics of recursion equations has been added. Annotation copyright Book News, Inc. Portland, Or.
Price: 82.57 USD
Location: Jessup, Maryland
End Time: 2024-10-26T19:54:09.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 14 Days
Refund will be given as: Money Back
Return policy details:
Book Title: Computability, Complexity, and Languages : Fundamentals of Theore
Number of Pages: 609 Pages
Language: English
Publication Name: Computability, Complexity, and Languages : Fundamentals of Theoretical Computer Science
Publisher: Elsevier Science & Technology
Publication Year: 1994
Item Height: 0.6 in
Subject: Machine Theory, Programming / Algorithms, Applied, Linguistics / General, Discrete Mathematics
Features: Revised
Item Weight: 35.5 Oz
Type: Textbook
Item Length: 9 in
Author: Martin Davis, Ron Sigal, Elaine J. Weyuker
Subject Area: Mathematics, Computers, Language Arts & Disciplines
Series: Computer Science and Scientific Computing Ser.
Item Width: 6 in
Format: Hardcover
