東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Turing computability = theory and ap...

Soare, Robert I.

Linked to FindBook

Google Book

Amazon

博客來

Turing computability = theory and applications /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Turing computability/ by Robert I. Soare.
Reminder of title:	theory and applications /
Author:	Soare, Robert I.
Published:	Berlin, Heidelberg :Springer Berlin Heidelberg : : 2016.,
Description:	xxxvi, 263 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Computable functions. -
Online resource:	http://dx.doi.org/10.1007/978-3-642-31933-4
ISBN:	9783642319334

Turing computability = theory and applications /
Soare, Robert I.

Turing computabilitytheory and applications /[electronic resource] :by Robert I. Soare. - Berlin, Heidelberg :Springer Berlin Heidelberg :2016. - xxxvi, 263 p. :ill., digital ;24 cm. - Theory and applications of computability,2190-619X. - Theory and applications of computability..

Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers and to computability theory, the study of what machines can and cannot compute. This book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic. The author presents the subject as an art to be practiced, and an art in the aesthetic sense of inherent beauty which all mathematicians recognize in their subject. Part I gives a thorough development of the foundations of computability, from the definition of Turing machines up to finite injury priority arguments. Key topics include relative computability, and computably enumerable sets, those which can be effectively listed but not necessarily effectively decided, such as the theorems of Peano arithmetic. Part II includes the study of computably open and closed sets of reals and basis and nonbasis theorems for effectively closed sets. Part III covers minimal Turing degrees. Part IV is an introduction to games and their use in proving theorems. Finally, Part V offers a short history of computability theory. The author is a leading authority on the topic and he has taught the subject using the book content over decades, honing it according to experience and feedback from students, lecturers, and researchers around the world. Most chapters include exercises, and the material is carefully structured according to importance and difficulty. The book is suitable for advanced undergraduate and graduate students in computer science and mathematics and researchers engaged with computability and mathematical logic.

ISBN: 9783642319334

Standard No.: 10.1007/978-3-642-31933-4doiSubjects--Topical Terms:

559829
Computable functions.

LC Class. No.: QA9.59

Dewey Class. No.: 511.352

Turing computability = theory and applications /
LDR:02840nmm a2200337 a 4500 001 2041180
003 DE-He213
005 20161117154420.0
006 m d
007 cr nn 008maaau
008 170118s2016 gw s 0 eng d
020 $a 9783642319334 $q (electronic bk.)
020 $a 9783642319327 $q (paper)
024 7 $a 10.1007/978-3-642-31933-4 $2 doi
035 $a 978-3-642-31933-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.59
072 7 $a UY $2 bicssc
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a COM031000 $2 bisacsh
082 0 4 $a 511.352 $2 23
090 $a QA9.59 $b .S676 2016
100 1 $a Soare, Robert I. $3 2199730
245 1 0 $a Turing computability $h [electronic resource] : $b theory and applications / $c by Robert I. Soare.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2016.
300 $a xxxvi, 263 p. : $b ill., digital ; $c 24 cm.
490 1 $a Theory and applications of computability, $x 2190-619X
520 $a Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers and to computability theory, the study of what machines can and cannot compute. This book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic. The author presents the subject as an art to be practiced, and an art in the aesthetic sense of inherent beauty which all mathematicians recognize in their subject. Part I gives a thorough development of the foundations of computability, from the definition of Turing machines up to finite injury priority arguments. Key topics include relative computability, and computably enumerable sets, those which can be effectively listed but not necessarily effectively decided, such as the theorems of Peano arithmetic. Part II includes the study of computably open and closed sets of reals and basis and nonbasis theorems for effectively closed sets. Part III covers minimal Turing degrees. Part IV is an introduction to games and their use in proving theorems. Finally, Part V offers a short history of computability theory. The author is a leading authority on the topic and he has taught the subject using the book content over decades, honing it according to experience and feedback from students, lecturers, and researchers around the world. Most chapters include exercises, and the material is carefully structured according to importance and difficulty. The book is suitable for advanced undergraduate and graduate students in computer science and mathematics and researchers engaged with computability and mathematical logic.
650 0 $a Computable functions. $3 559829
650 0 $a Computer science $x Mathematics. $3 532725
650 0 $a Turing test. $3 791469
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Theory of Computation. $3 892514
650 2 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Mathematical Logic and Foundations. $3 892656
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Theory and applications of computability. $3 2199731
856 4 0 $u http://dx.doi.org/10.1007/978-3-642-31933-4
950 $a Computer Science (Springer-11645)