國立虎尾科技大學 |

The Foundations of Computability Theory

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	The Foundations of Computability Theory/ by Borut Robič.
作者:	Robič, Borut.
面頁冊數:	XXI, 422 p.online resource. :
Contained By:	Springer Nature eBook
標題:	History of Mathematical Sciences. -
電子資源:	https://doi.org/10.1007/978-3-662-62421-0
ISBN:	9783662624210

The Foundations of Computability Theory
Robič, Borut.

The Foundations of Computability Theory[electronic resource] /by Borut Robič. - 2nd ed. 2020. - XXI, 422 p.online resource.

Part I, The Roots of Computability Theory -- Introduction -- The Foundational Crisis of Mathematics -- Formalism -- Hilbert’s Attempt at Recovery -- Part II, Classicial Computability Theory -- The Quest for a Formalization -- The Turing Machine -- The First Basic Results -- Incomputable Problems -- Methods of Proving Incomputability -- Part III, Relative Computability -- Computation with External Help -- Degrees of Unsolvability -- The Turing Hierarchy of Unsolvability -- The Class D of Degrees of Unsolvability -- C.E. Degrees and the Priority Method -- The Arithmetical Hierarchy -- Part IV, Back to the Roots -- Computability (Church-Turing) Thesis Revisited -- Further Reading -- App. A, Mathematical Background -- App. B, Notation Index -- Glossary -- References -- Index.

This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. In Part I the author introduces computability theory, with chapters on the foundational crisis of mathematics in the early twentieth century, and formalism. In Part II he explains classical computability theory, with chapters on the quest for formalization, the Turing Machine, and early successes such as defining incomputable problems, c.e. (computably enumerable) sets, and developing methods for proving incomputability. In Part III he explains relative computability, with chapters on computation with external help, degrees of unsolvability, the Turing hierarchy of unsolvability, the class of degrees of unsolvability, c.e. degrees and the priority method, and the arithmetical hierarchy. Finally, in the new Part IV the author revisits the computability (Church-Turing) thesis in greater detail. He offers a systematic and detailed account of its origins, evolution, and meaning, he describes more powerful, modern versions of the thesis, and he discusses recent speculative proposals for new computing paradigms such as hypercomputing. This is a gentle introduction from the origins of computability theory up to current research, and it will be of value as a textbook and guide for advanced undergraduate and graduate students and researchers in the domains of computability theory and theoretical computer science. This new edition is completely revised, with almost one hundred pages of new material. In particular the author applied more up-to-date, more consistent terminology, and he addressed some notational redundancies and minor errors. He developed a glossary relating to computability theory, expanded the bibliographic references with new entries, and added the new part described above and other new sections.

ISBN: 9783662624210

Standard No.: 10.1007/978-3-662-62421-0doiSubjects--Topical Terms:

785417
History of Mathematical Sciences.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

The Foundations of Computability Theory
LDR:04122nam a22004215i 4500 001 1025427
003 DE-He213
005 20201113080853.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783662624210 $9 978-3-662-62421-0
024 7 $a 10.1007/978-3-662-62421-0 $2 doi
035 $a 978-3-662-62421-0
050 4 $a QA75.5-76.95
050 4 $a QA76.63
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
100 1 $a Robič, Borut. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1127748
245 1 4 $a The Foundations of Computability Theory $h [electronic resource] / $c by Borut Robič.
250 $a 2nd ed. 2020.
264 1 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2020.
300 $a XXI, 422 p. $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
505 0 $a Part I, The Roots of Computability Theory -- Introduction -- The Foundational Crisis of Mathematics -- Formalism -- Hilbert’s Attempt at Recovery -- Part II, Classicial Computability Theory -- The Quest for a Formalization -- The Turing Machine -- The First Basic Results -- Incomputable Problems -- Methods of Proving Incomputability -- Part III, Relative Computability -- Computation with External Help -- Degrees of Unsolvability -- The Turing Hierarchy of Unsolvability -- The Class D of Degrees of Unsolvability -- C.E. Degrees and the Priority Method -- The Arithmetical Hierarchy -- Part IV, Back to the Roots -- Computability (Church-Turing) Thesis Revisited -- Further Reading -- App. A, Mathematical Background -- App. B, Notation Index -- Glossary -- References -- Index.
520 $a This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. In Part I the author introduces computability theory, with chapters on the foundational crisis of mathematics in the early twentieth century, and formalism. In Part II he explains classical computability theory, with chapters on the quest for formalization, the Turing Machine, and early successes such as defining incomputable problems, c.e. (computably enumerable) sets, and developing methods for proving incomputability. In Part III he explains relative computability, with chapters on computation with external help, degrees of unsolvability, the Turing hierarchy of unsolvability, the class of degrees of unsolvability, c.e. degrees and the priority method, and the arithmetical hierarchy. Finally, in the new Part IV the author revisits the computability (Church-Turing) thesis in greater detail. He offers a systematic and detailed account of its origins, evolution, and meaning, he describes more powerful, modern versions of the thesis, and he discusses recent speculative proposals for new computing paradigms such as hypercomputing. This is a gentle introduction from the origins of computability theory up to current research, and it will be of value as a textbook and guide for advanced undergraduate and graduate students and researchers in the domains of computability theory and theoretical computer science. This new edition is completely revised, with almost one hundred pages of new material. In particular the author applied more up-to-date, more consistent terminology, and he addressed some notational redundancies and minor errors. He developed a glossary relating to computability theory, expanded the bibliographic references with new entries, and added the new part described above and other new sections.
650 2 4 $a History of Mathematical Sciences. $3 785417
650 2 4 $a History of Computing. $3 669953
650 2 4 $a Mathematical Logic and Foundations. $3 669393
650 1 4 $a Theory of Computation. $3 669322
650 0 $a History. $3 669538
650 0 $a Mathematics. $3 527692
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Computers. $3 565115
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783662624203
776 0 8 $i Printed edition: $z 9783662624227
776 0 8 $i Printed edition: $z 9783662624234
856 4 0 $u https://doi.org/10.1007/978-3-662-62421-0
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)