- Series: Texts in Computer Science
- Hardcover: 418 pages
- Publisher: Springer; 2006 edition (March 23, 2006)
- Language: English
- ISBN-10: 1846282977
- ISBN-13: 978-1846282973
- Product Dimensions: 7 x 0.8 x 9.2 inches
- Shipping Weight: 2 pounds (View shipping rates and policies)
- Average Customer Review: 3 customer reviews
- Amazon Best Sellers Rank: #1,871,072 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Theory of Computation (Texts in Computer Science) 2006th Edition
Use the Amazon App to scan ISBNs and compare prices.
"Enlightenment Now: The Case for Reason, Science, Humanism, and Progress"
Is the world really falling apart? Is the ideal of progress obsolete? Cognitive scientist and public intellectual Steven Pinker urges us to step back from the gory headlines and prophecies of doom, and instead, follow the data: In seventy-five jaw-dropping graphs, Pinker shows that life, health, prosperity, safety, peace, knowledge, and happiness are on the rise. Learn more
Customers who bought this item also bought
Customers who viewed this item also viewed
What other items do customers buy after viewing this item?
From the reviews:
"This book represents the lecture notes of Dexter Kozen for the first-year graduate students in computer science at Cornell University. The book contains 41 primary lectures and 10 supplementary lectures covering more specialized and advanced topics. There are also 12 homework sets and several miscellaneous homework exercises … many with hints and complete solutions. … there is a bibliography of 127 titles. The book contains a very useful list of notations and abbreviations and an index." (Daniela Marinescu, Zentralblatt MATH, Vol. 1102 (4), 2007)
"The book is a collection of lecture notes based on a one-semester course for first-year graduate students in computer science at Cornell … . The course serves a dual purpose: to cover material in the foundations of computing for graduate students in computer science preparing for their Ph.D. qualifying exams, and to provide an introduction to some more advanced topics in the theory of computational complexity for those intending to pursue further study in the area." (Ulrich Tamm, Mathematical Reviews, Issue 2007 f)
"This textbook covers topics essential to the theory of computation. … In short, this is an interesting and enjoyable book that is strongly recommended to people who appreciate accuracy and concision. It will surely be an important textbook on the theory of computation for years to come. The intended audience is advanced undergraduate and first-year graduate students in computer science. It could also be useful to computer scientists with an interest in the foundation of computing and computational complexity." (G. Ciobanu, Computing Reviews, Vol. 49 (5), May, 2008)
"Kozen does a great job of explaining the material… The book is a continuation of the author’s excellent work in the field… The 12 homework sets, along with several miscellaneous problem sets, make this book an excellent pedagogical option for the classroom." (Hector Zenil, ACM Computing Reviews, Vol. 49 (9), September 2008)
From the Back Cover
In these early years of the 21st Century, researchers in the field of computing are delving ever further into the new possibilities of the science and to the primary tools that form its foundations. The theory behind computation has never been more important.
Theory of Computation is a unique textbook that serves the dual purposes of covering core material in the foundations of computing, as well as providing an introduction to some more advanced contemporary topics. This innovative text focuses primarily, although by no means exclusively, on computational complexity theory: the classification of computational problems in terms of their inherent complexity. It incorporates rigorous treatment of computational models, such as deterministic, nondeterministic, and alternating Turing machines; circuits; probabilistic machines; interactive proof systems; automata on infinite objects; and logical formalisms. Although the complexity universe stops at polynomial space in most treatments, this work also examines higher complexity levels all the way up through primitive and partial recursive functions and the arithmetic and analytic hierarchies.
Topics and features:
• Provides in-depth coverage of both classical and contemporary approaches in one useful, concise volume
• Organized into readily applicable, self-contained primary and secondary lectures
• Contains more than 180 homework exercises of varying difficulty levels, many with hints and solutions
• Includes approximation and inapproximation results, and some lower bounds
• Treats complexity theory and classical recursion theory in a unified framework
Advanced undergraduates and first-year graduates in Computer Science or Mathematics will receive a thorough grounding in the core theory of computation and computational complexity, as well as an introduction to advanced contemporary topics for further study. Computing professionals and other scientists interested in learning more about these topics will also find this text extremely useful.
Prof. Dexter Kozen teaches at Cornell University, Ithaca, New York, and has comprehensively class-tested this book’s content. He authored the highly successful Automata and Computability, which offers an introduction to the basic theoretical models of computability, and The Design and Analysis of Algorithms.
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
Although I have only read through lecture 20 (of 41), I have found immediate applications of the material in this book to my research. In fact, last night after reading lecture 18 I was able to add a footnote to a journal submission directing the reader to this lecture for a 7/8-approximation algorithm and a proof that MaxSAT is polynomially solvable iff P=NP. These are both results that my paper cites from separate research papers and it pleased me that I was now able to point the reader to a text for further study. I also have learned about many exotic complexity classes and problems in this book, some of which I had encountered in research-level seminars in the past few years. Having a single text that I can read to learn about all of these results is a godsend.
I strongly recommend this book to anyone who is pursuing study or research in computer science at the doctoral level, particularly if they have an interest in theory, complexity or cryptography. This book has already been enormously useful to me. I would like to teach a class someday based on this book.
This is NOT a book on automata or an introduction to theory of computation. You should already understand what theory of computation is all about before you read this book. A good introduction to the field is Sipser, although Dexter Kozen also has an introductory level book that will probably flow well into this one. This is also NOT a good place to work on basic mathematical tools. You will be expected to have them already; if you aren't good at reading mathematical proofs, you will need either extreme patience and diligence or previous work on the skill before you read this book.
Topics include advanced results about basic time/space complexity classes, alternation, probablistic and parallel complexity classes, properties (complexity and decidability) of logical theories, partial recursive function theory, and other topics too numerous to mention. The text covers all major areas of the field, but the emphasis is definitely in favor of complexity results.