Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science: Computer Science and Scientific Computing
Autor Martin Davis, Ron Sigal, Elaine J. Weyukeren Limba Engleză Paperback – 18 mar 1994
- 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.
Preț: 331.32 lei
Preț vechi: 438.29 lei
-24% Nou
Puncte Express: 497
Preț estimativ în valută:
63.43€ • 65.93$ • 52.59£
63.43€ • 65.93$ • 52.59£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780122063824
ISBN-10: 0122063821
Pagini: 609
Ilustrații: further reading, index
Dimensiuni: 152 x 229 x 47 mm
Greutate: 1.1 kg
Ediția:Revised
Editura: ELSEVIER SCIENCE
Seria Computer Science and Scientific Computing
ISBN-10: 0122063821
Pagini: 609
Ilustrații: further reading, index
Dimensiuni: 152 x 229 x 47 mm
Greutate: 1.1 kg
Ediția:Revised
Editura: ELSEVIER SCIENCE
Seria Computer Science and Scientific Computing
Public țintă
Junior, senior, and graduate level students in Computability, Complexity, and Languages or Introduction to Theoretical Computer Science courses.Cuprins
Preliminaries. Computability: Programs and Computable Functions. Primitive Recursive Functions. A Universal Program. Calculations on Strings. Turing Machines. Processes and Grammars. Classifying Unsolvable Problems. Grammars and Automata: Regular Languages. Context-Free Languages. Context-Sensitive Languages. Logic: Propositional Calculus. Quantification Theory. Complexity: Abstract Complexity. PolynomialTime Computability. Semantics: Approximation Orderings. Denotational Semantics of Recursion Equations. Operational Semantics of Recursion Equations. Suggestions for Further Reading. Subject Index.
Recenzii
"If there is a single book on the theory of computing that should be in every college library collection, this is it. Although written as a text for an advanced undergraduate course in theoretical computer science, the book may serve as an introductory resource, or the foundation for independent study, in many areas of theoretical computing: grammars, automata theory, computability, complexity theory, and unsolvability. The beauty of this book is that the breadth of coverage is complemented with extraordinary depth." --CHOICE
"Theoretical computer science is often viewed as a collection of disparate topics, including computability theory, formal language theory, complexity theory, logic, and so on. This well-written book attempts to unify the subject by introducing each of these topics in turn, then showing how they relate to each other... This is an excellent book that succeeds in tying together a number of areas in theoretical computer science." --COMPUTING REVIEWS
"Theoretical computer science is often viewed as a collection of disparate topics, including computability theory, formal language theory, complexity theory, logic, and so on. This well-written book attempts to unify the subject by introducing each of these topics in turn, then showing how they relate to each other... This is an excellent book that succeeds in tying together a number of areas in theoretical computer science." --COMPUTING REVIEWS