TY  - BOOK
AU  - Moret,Bernard M.
TI  - The theory of computation
SN  - 0201258285
AV  - QA267 .M67 1998
U1  - 004 22
PY  - 1998///
CY  - Reading, Mass.
PB  - Addison-Wesley
KW  - Machine theory
N1  -  	Online version:
Moret, B.M.E. (Bernard M.E.)
Theory of computation.
Reading, Mass. : Addison-Wesley, c1998
(OCoLC)654250841; Includes bibliographical references (p. 407-419) and index; 1. Introduction --
2. Preliminaries --
3. Finite Automata and Regular Languages --
4. Universal Models of Computation --
5. Computability Theory --
6. Complexity Theory: Foundations --
7. Proving Problems Hard --
8. Complexity Theory in Practice --
9. Complexity Theory: The Frontier --
A: Proofs; TOC; CSE; ECE
N2  - 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
UR  - https://www.worldcat.org/title/theory-of-computation/oclc/37293291&referer=brief_results
UR  - http://lib.ewubd.edu/ebook/3321
ER  -