The theory of computation
著者
書誌事項
The theory of computation
Addison-Wesley, c1998
大学図書館所蔵 全6件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references (p. 407-419) and index
内容説明・目次
内容説明
Taking a practical approach, this modern introduction to the theory of computation focuses on the study of problem solving through computation in the presence of realistic resource constraints. The Theory of Computation explores questions and methods that characterize theoretical computer science while relating all developments to practical issues in computing. The book establishes clear limits to computation, relates these limits to resource usage, and explores possible avenues of compromise through approximation and randomization. The book also provides an overview of current areas of research in theoretical computer science that are likely to have a significant impact on the practice of computing within the next few years.
目次
(Each chapter concludes with Exercises and a Bibliography.)
1. Introduction.
Motivation and Overview.
History.
2. Preliminaries.
Numbers and their Representation.
Problems, Instances, and Solutions.
Asymptotic Notation.
Graphs.
Alphabets, Strings, and Languages.
Functions and Infinite Sets.
Pairing Functions.
Cantor's Proof: the Technique of Diagonalization.
Implications for Computability.
3. Finite Automata and Regular Languages.
Introduction.
States and Automata.
Finite Automata as Language Acceptors.
Determinism and Nondeterminism.
Checking vs. Computing.
Properties of Finite Automata.
Equivalence of Finite Automata.
Epsilon Transitions.
Regular Expressions.
Definitions and Examples.
Regular Expressions and Finite Automata.
Regular Expressions from Deterministic Finite Automata.
The Base Case.
The Inductive Step.
Completing the Proof.
Reviewing the Construction of Regular Expressions from Finite Automata.
The Pumping Lemma and Closure Properties.
The Pumping Lemma.
Closure Properties of Regular Languages.
Ad Hoc Closure Properties.
Conclusion.
4. Universal Models of Computation.
Encoding Instances.
Choosing a Model of Computation.
Issues of Computability.
The Turing Machine.
Multitape Turing Machines.
The Register Machine.
Translation Between Models.
Model Independence.
Turing Machines as Enumerators and Acceptors.
5. Computability Theory.
Primitive Recursive Functions.
Defining Primitive Recursive Functions.
Ackermann's Function and the Grzegorczyk Hierarchy.
Partial Recursive Functions.
Arithmetization: Encoding a Turing Machine.
Programming Systems.
Recursive and R.E. Sets.
Rice's Theorem and the Recursion Theorem.
Degrees of Unsolvability.
6. Complexity Theory: Foundations.
Reductions.
Reducibility Between Problems.
Reductions and Complexity Classes.
Classes of Complexity.
Hierarchy Theorems.
Model-Independent Complexity Classes.
Deterministic Complexity Classes.
Certificates and Nondeterminism.
Complete Problems.
NP-Completeness: Cook's Theorem.
Space Completeness.
Polynomial Space.
Polylogarithmic Space.
Provably Intractable Problems.
7. Proving Problems Hard.
Some Important NP-Complete Problems.
Some P-Completeness Proofs.
From Decision to Optimization and Enumeration.
Turing Reductions and Search Problems.
The Polynomial Hierarchy.
Enumeration Problems.
8. Complexity Theory in Practice.
Circumscribing Hard Problems.
Restrictions of Hard Problems.
Promise Problems.
Strong NP-Completeness.
The Complexity of Approximation.
Definitions.
Constant-Distance Approximations.
Approximation Schemes.
Fixed-Ratio Approximations and the Class OptNP.
No Guarantee Unless P equals NP.
The Power of Randomization.
9. Complexity Theory: The Frontier.
Introduction.
The Complexity of Specific Instances.
Average-Case Complexity.
Parallelism and Communication.
Parallelism.
Models of Parallel Computation.
When Does Parallelism Pay?
Communication and Complexity.
Interactive Proofs and Probabilistic Proof Checking.
Interactive Proofs.
Zero-Knowledge Proofs.
Probabilistically Checkable Proofs.
Complexity and Constructive Mathematics.
References.
A. Proofs.
Quod Erat Demonstrandum, or What is a Proof?
Proof Elements.
Proof Techniques.
Construction: Linear Thinking.
Contradiction: Reductio ad Absurdum.
Induction: the Domino Principle.
Diagonalization: Putting it all Together.
How to Write a Proof.
Practice. 0201258285T04062001
「Nielsen BookData」 より