计算理论导论
2002-8
机械工业出版社
塞普斯
无
This book——by a noted authority and educator in the field——presents computer
science theory from a uniquely intuitive,“big picture”perspective.The author grounds his clear and interesting study on broad mathematical princi-ples,not low-level technical details:proofs are presented with a “proof idea”component that re-
veals the concetp underlying the mathematical formalism.Similarly,algorithms are pr-esented using prose rather than pseudocode to focus attention on the algorithms the-
mselves,rather than on specific models.Formerly published in a Preliminary Edition,
this First Edition features additional chapters on space complexity (Chapter 8),pro-vable intractability (Chapter 9)and advanced topics in computability theory(Chapter
10).For further information,see the World Wide Web site for the book at:
math.mit.edu/sipser/book.html
Preface
To the student
To the educator
The current edition
Feedback to the author
Acknowledgments
0 Introduction
0. l Automata, Computability, and Complexity
Complexity theory
Computability
无