國立虎尾科技大學 |

Limits of Computation = From a Programming Perspective /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Limits of Computation/ by Bernhard Reus.
Reminder of title:	From a Programming Perspective /
Author:	Reus, Bernhard.
Description:	XVIII, 348 p. 80 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-319-27889-6
ISBN:	9783319278896

Limits of Computation = From a Programming Perspective /
Reus, Bernhard.

Limits of ComputationFrom a Programming Perspective /[electronic resource] :by Bernhard Reus. - 1st ed. 2016. - XVIII, 348 p. 80 illus.online resource. - Undergraduate Topics in Computer Science,1863-7310. - Undergraduate Topics in Computer Science,.

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:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Limits of Computation = From a Programming Perspective /
LDR:02528nam a22003855i 4500 001 972465
003 DE-He213
005 20200702062321.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319278896 $9 978-3-319-27889-6
024 7 $a 10.1007/978-3-319-27889-6 $2 doi
035 $a 978-3-319-27889-6
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
100 1 $a Reus, Bernhard. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1106568
245 1 0 $a Limits of Computation $h [electronic resource] : $b From a Programming Perspective / $c by Bernhard Reus.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XVIII, 348 p. 80 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Undergraduate Topics in Computer Science, $x 1863-7310
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 Algorithms. $3 527865
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Mathematics of Algorithmic Complexity. $3 1020203
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319278872
776 0 8 $i Printed edition: $z 9783319278889
830 0 $a Undergraduate Topics in Computer Science, $x 1863-7310 $3 1254738
856 4 0 $u https://doi.org/10.1007/978-3-319-27889-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)