大葉大學圖書館 |

Limits of computation[electronic resource] :from a programming perspective /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	005.1
書名/作者:	Limits of computation : from a programming perspective // by Bernhard Reus.
作者:	Reus, Bernhard.
出版者:	Cham : : Springer International Publishing :, 2016.
面頁冊數:	xviii, 348 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Computer programming.
標題:	Computer science - Mathematics.
標題:	Computer Science.
標題:	Algorithm Analysis and Problem Complexity.
標題:	Mathematics of Algorithmic Complexity.
ISBN:	9783319278896
ISBN:	9783319278872
內容註:	Foreword -- Limits? What Limits? -- Part I Computability -- Problems and Effective Procedures -- The WHILE-Language -- Semantics of WHILE -- Extensions of WHILE -- Programs As Data Objects -- A Self-Interpreter for WHILE -- An Undecidable (Non-computable) Problem -- More Undecidable Problems -- Self-referencing Programs -- The Church-Turing Thesis -- Part II Complexity -- Measuring Time Usage -- Complexity Classes -- Robustness of P -- Hierarchy Theorems -- Famous Problems in P -- Common Problems not Known to be in P -- The One-Million-Dollar Question -- How Hard is a Problem? -- Complete Problems -- How to Solve NP-complete Problems? -- Part III Emerging New Models of Computation - "going nano" -- Molecular Computing -- Quantum Computing -- Appendix A: Further Reading - Computability and Complexity Textbooks -- Glossary -- Index.
摘要、提要註:	This textbook discusses the most fundamental and puzzling questions about the foundations of computing. In 23 lecture-sized chapters it provides an exciting tour through the most important results in the field of computability and time complexity, including the Halting Problem, Rice's Theorem, Kleene's Recursion Theorem, the Church-Turing Thesis, Hierarchy Theorems, and Cook-Levin's Theorem. Each chapter contains classroom-tested material, including examples and exercises. Links between adjacent chapters provide a coherent narrative. Fundamental results are explained lucidly by means of programs written in a simple, high-level imperative programming language, which only requires basic mathematical knowledge. Throughout the book, the impact of the presented results on the entire field of computer science is emphasised. Examples range from program analysis to networking, from database programming to popular games and puzzles. Numerous biographical footnotes about the famous scientists who developed the subject are also included. "Limits of Computation" offers a thorough, yet accessible, introduction to computability and complexity for the computer science student of the 21st century.
電子資源:	http://dx.doi.org/10.1007/978-3-319-27889-6

Limits of computation[electronic resource] :from a programming perspective /
Reus, Bernhard.

Limits of computationfrom a programming perspective /[electronic resource] :by Bernhard Reus. - Cham :Springer International Publishing :2016. - xviii, 348 p. :ill., digital ;24 cm. - Undergraduate topics in computer science,1863-7310. - Undergraduate topics in computer science..

Foreword -- Limits? What Limits? -- Part I Computability -- Problems and Effective Procedures -- The WHILE-Language -- Semantics of WHILE -- Extensions of WHILE -- Programs As Data Objects -- A Self-Interpreter for WHILE -- An Undecidable (Non-computable) Problem -- More Undecidable Problems -- Self-referencing Programs -- The Church-Turing Thesis -- Part II Complexity -- Measuring Time Usage -- Complexity Classes -- Robustness of P -- Hierarchy Theorems -- Famous Problems in P -- Common Problems not Known to be in P -- The One-Million-Dollar Question -- How Hard is a Problem? -- Complete Problems -- How to Solve NP-complete Problems? -- Part III Emerging New Models of Computation - "going nano" -- Molecular Computing -- Quantum Computing -- Appendix A: Further Reading - Computability and Complexity Textbooks -- Glossary -- Index.

This textbook discusses the most fundamental and puzzling questions about the foundations of computing. In 23 lecture-sized chapters it provides an exciting tour through the most important results in the field of computability and time complexity, including the Halting Problem, Rice's Theorem, Kleene's Recursion Theorem, the Church-Turing Thesis, Hierarchy Theorems, and Cook-Levin's Theorem. Each chapter contains classroom-tested material, including examples and exercises. Links between adjacent chapters provide a coherent narrative. Fundamental results are explained lucidly by means of programs written in a simple, high-level imperative programming language, which only requires basic mathematical knowledge. Throughout the book, the impact of the presented results on the entire field of computer science is emphasised. Examples range from program analysis to networking, from database programming to popular games and puzzles. Numerous biographical footnotes about the famous scientists who developed the subject are also included. "Limits of Computation" offers a thorough, yet accessible, introduction to computability and complexity for the computer science student of the 21st century.

ISBN: 9783319278896

Standard No.: 10.1007/978-3-319-27889-6doiSubjects--Topical Terms:

179920
Computer programming.

LC Class. No.: QA76.6

Dewey Class. No.: 005.1

Limits of computation[electronic resource] :from a programming perspective /
LDR:03035nam a2200325 a 4500 001 446507
003 DE-He213
005 20160910132807.0
006 m d
007 cr nn 008maaau
008 161201s2016 gw s 0 eng d
020 $a 9783319278896 $q (electronic bk.)
020 $a 9783319278872 $q (paper)
024 7 $a 10.1007/978-3-319-27889-6 $2 doi
035 $a 978-3-319-27889-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.6
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 005.1 $2 23
090 $a QA76.6 $b .R445 2016
100 1 $a Reus, Bernhard. $3 639215
245 1 0 $a Limits of computation $h [electronic resource] : $b from a programming perspective / $c by Bernhard Reus.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xviii, 348 p. : $b ill., digital ; $c 24 cm.
490 1 $a Undergraduate topics in computer science, $x 1863-7310
505 0 $a Foreword -- Limits? What Limits? -- Part I Computability -- Problems and Effective Procedures -- The WHILE-Language -- Semantics of WHILE -- Extensions of WHILE -- Programs As Data Objects -- A Self-Interpreter for WHILE -- An Undecidable (Non-computable) Problem -- More Undecidable Problems -- Self-referencing Programs -- The Church-Turing Thesis -- Part II Complexity -- Measuring Time Usage -- Complexity Classes -- Robustness of P -- Hierarchy Theorems -- Famous Problems in P -- Common Problems not Known to be in P -- The One-Million-Dollar Question -- How Hard is a Problem? -- Complete Problems -- How to Solve NP-complete Problems? -- Part III Emerging New Models of Computation - "going nano" -- Molecular Computing -- Quantum Computing -- Appendix A: Further Reading - Computability and Complexity Textbooks -- Glossary -- Index.
520 $a This textbook discusses the most fundamental and puzzling questions about the foundations of computing. In 23 lecture-sized chapters it provides an exciting tour through the most important results in the field of computability and time complexity, including the Halting Problem, Rice's Theorem, Kleene's Recursion Theorem, the Church-Turing Thesis, Hierarchy Theorems, and Cook-Levin's Theorem. Each chapter contains classroom-tested material, including examples and exercises. Links between adjacent chapters provide a coherent narrative. Fundamental results are explained lucidly by means of programs written in a simple, high-level imperative programming language, which only requires basic mathematical knowledge. Throughout the book, the impact of the presented results on the entire field of computer science is emphasised. Examples range from program analysis to networking, from database programming to popular games and puzzles. Numerous biographical footnotes about the famous scientists who developed the subject are also included. "Limits of Computation" offers a thorough, yet accessible, introduction to computability and complexity for the computer science student of the 21st century.
650 0 $a Computer programming. $3 179920
650 0 $a Computer science $x Mathematics. $3 382369
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 463701
650 2 4 $a Mathematics of Algorithmic Complexity. $3 611242
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Undergraduate topics in computer science. $3 466963
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-27889-6
950 $a Computer Science (Springer-11645)