Concise guide to computation theory Akira Maruoka
Publication details: London Springer 2011Description: xvii, 281 pages : illustrationsISBN: 9780857295347; 0857295349 (alk. paper)Subject(s): COMPUTATIONAL COMPLEXITY | COMPUTABLE FUNCTIONS | MACHINE THEORYLOC classification: QA 267.7 Mar| Item type | Home library | Call number | Materials specified | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
MONOGRAPH
|
CBU-MAIN LIBRARY, KITWE. | QA 267.7 Mar (Browse shelf(Opens below)) | Available | 749035 |
Browsing CBU-MAIN LIBRARY, KITWE. shelves Close shelf browser (Hides shelf browser)
|
|
No cover image available |
|
|
No cover image available |
|
||
| QA 267 Ric Automata, computability, and complexity: theory and applications | QA 267 Ric Automata, computability, and complexity: theory and applications | QA 267.5S4 Eil Automata, Languages and machines | QA 267.7 Mar Concise guide to computation theory | QA 269 Gib A primer in game theory | QA 271 Adl Probability and statistics for every man | QA 273.A5 Bar Probability, modelling uncertanity |
Includes bibliographical references (p. 275-276) and index.
Part I. The theory of computation -- 1. Everything begins with computation -- 2. Preliminaries to the theory of computation -- Part II. Automata and languages -- 3. Finite automata -- 4. Context-free languages -- 5. Pushdown automata -- Part III. Computability -- 6. Turing machine -- 7. Universality of Turing machine and its limitations -- Part IV. Complexity of computation -- 8. Computational complexity based on Turing machines -- 9. Computational complexity based on Boolean circuits -- 10. NP-completeness -- Part V. Conclusions and exercise solutions --11. Solutions -- 12. Concluding remarks.
There are no comments on this title.