
ISBN
| 9780534950972 |
DDC
| 511.35 |
Tác giả CN
| Sipser, Michael |
Nhan đề
| Introduction to the theory of computation / Michael Sipser |
Lần xuất bản
| 2nd, International ed. |
Thông tin xuất bản
| Boston : Thomson Course Technology, 2006. |
Mô tả vật lý
| xix, 431 pages. : illustrations ; 24 cm. |
Tóm tắt
| "Michael Sipser's philosophy in writing this book is simple: make the subject interesting and relevant, and the students will learn. His emphasis on unifying computer science theory - rather than offering a collection of low-level details - sets the book apart, as do his intuitive explanations. Throughout the book, Sipser - a noted authority on the theory of computation - builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own. INTRODUCTION TO THE THEORY OF COMPUTATION provides a mathematical treatment of computation theory grounded in theorems and proofs. Proofs are presented with a "proof idea" component to reveal the concepts underpinning the formalism. Algorithms are presented using prose instead of pseudocode to focus attention on the algorithms themselves, rather than on specific computational models. Topic coverage, terminology, and order of presentation are traditional for an upper-level course in computer science theory. Users of the Preliminary Edition (now out of print) will be interested to note several new chapters on complexity theory: Chapter 8 on space complexity; Chapter 9 on provable intractability, and Chapter 10 on advanced topics, including approximation algorithms, alternation, interactive proof systems, cryptography, and parallel computing." |
Thuật ngữ chủ đề
| Computer science-Mathematics |
Thuật ngữ chủ đề
| Machine theory |
Thuật ngữ chủ đề
| Computational complexity |
Khoa
| Khoa Cơ bản |
Địa chỉ
| 300Q12_Kho Mượn_02(1): 073338 |
|
000
| 00000nam#a2200000u##4500 |
---|
001 | 24942 |
---|
002 | 15 |
---|
004 | 340FB144-AF7D-4924-AA44-BFCFAA32BAD9 |
---|
005 | 202010190916 |
---|
008 | 201019s2006 mau eng |
---|
009 | 1 0 |
---|
020 | |a9780534950972 |
---|
039 | |a20201019091601|bnghiepvu|y20201019091237|znghiepvu |
---|
040 | |aNTT |
---|
041 | |aeng |
---|
044 | |amau |
---|
082 | |a511.35|bS6189|223 |
---|
100 | |aSipser, Michael |
---|
245 | |aIntroduction to the theory of computation / |cMichael Sipser |
---|
250 | |a2nd, International ed. |
---|
260 | |aBoston : |bThomson Course Technology, |c2006. |
---|
300 | |axix, 431 pages. : |billustrations ; |c24 cm. |
---|
504 | |aIncludes bibliographical references (pages 415-420) and index. |
---|
520 | |a"Michael Sipser's philosophy in writing this book is simple: make the subject interesting and relevant, and the students will learn. His emphasis on unifying computer science theory - rather than offering a collection of low-level details - sets the book apart, as do his intuitive explanations. Throughout the book, Sipser - a noted authority on the theory of computation - builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own. INTRODUCTION TO THE THEORY OF COMPUTATION provides a mathematical treatment of computation theory grounded in theorems and proofs. Proofs are presented with a "proof idea" component to reveal the concepts underpinning the formalism. Algorithms are presented using prose instead of pseudocode to focus attention on the algorithms themselves, rather than on specific computational models. Topic coverage, terminology, and order of presentation are traditional for an upper-level course in computer science theory. Users of the Preliminary Edition (now out of print) will be interested to note several new chapters on complexity theory: Chapter 8 on space complexity; Chapter 9 on provable intractability, and Chapter 10 on advanced topics, including approximation algorithms, alternation, interactive proof systems, cryptography, and parallel computing." |
---|
541 | |aDự án VN Book Drive |
---|
650 | |aComputer science|xMathematics |
---|
650 | |aMachine theory |
---|
650 | |aComputational complexity |
---|
690 | |aKhoa Cơ bản |
---|
852 | |a300|bQ12_Kho Mượn_02|j(1): 073338 |
---|
856 | 1|uhttp://elib.ntt.edu.vn/documentdata01/2 tailieuthamkhao/500 khoahoc/anhbiasach/24942_introduction to the theory of computationthumbimage.jpg |
---|
890 | |a1|b0|c0|d0 |
---|
| |
Dòng |
Mã vạch |
Nơi lưu |
S.gọi Cục bộ |
Phân loại |
Bản sao |
Tình trạng |
Thành phần |
Đặt chỗ |
1
|
073338
|
Q12_Kho Mượn_02
|
511.35 S6189
|
Sách mượn tại chỗ
|
1
|
|
|
|
Không có liên kết tài liệu số nào
|
|
|
|