語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
The Foundations of Computability Theory
~
Robič, Borut.
The Foundations of Computability Theory
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
正題名/作者:
The Foundations of Computability Theory/ by Borut Robič.
作者:
Robič, Borut.
面頁冊數:
XX, 331 p. 109 illus.online resource. :
Contained By:
Springer Nature eBook
標題:
Computers. -
電子資源:
https://doi.org/10.1007/978-3-662-44808-3
ISBN:
9783662448083
The Foundations of Computability Theory
Robič, Borut.
The Foundations of Computability Theory
[electronic resource] /by Borut Robič. - 1st ed. 2015. - XX, 331 p. 109 illus.online resource.
Introduction -- The Foundational Crisis of Mathematics -- Formalism -- Hilbert’s Attempt at Recovery -- The Quest for a Formalization -- The Turing Machine -- The First Basic Results -- Incomputable Problems -- Methods of Proving the Incomputability -- 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 -- Further Reading -- App. A, Mathematical Background -- 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. 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.
ISBN: 9783662448083
Standard No.: 10.1007/978-3-662-44808-3doiSubjects--Topical Terms:
565115
Computers.
LC Class. No.: QA75.5-76.95
Dewey Class. No.: 004.0151
The Foundations of Computability Theory
LDR
:03137nam a22004215i 4500
001
965643
003
DE-He213
005
20200701163819.0
007
cr nn 008mamaa
008
201211s2015 gw | s |||| 0|eng d
020
$a
9783662448083
$9
978-3-662-44808-3
024
7
$a
10.1007/978-3-662-44808-3
$2
doi
035
$a
978-3-662-44808-3
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
1st ed. 2015.
264
1
$a
Berlin, Heidelberg :
$b
Springer Berlin Heidelberg :
$b
Imprint: Springer,
$c
2015.
300
$a
XX, 331 p. 109 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
505
0
$a
Introduction -- The Foundational Crisis of Mathematics -- Formalism -- Hilbert’s Attempt at Recovery -- The Quest for a Formalization -- The Turing Machine -- The First Basic Results -- Incomputable Problems -- Methods of Proving the Incomputability -- 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 -- Further Reading -- App. A, Mathematical Background -- 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. 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.
650
0
$a
Computers.
$3
565115
650
0
$a
Computer science—Mathematics.
$3
1253519
650
0
$a
Computer mathematics.
$3
1199796
650
1 4
$a
Theory of Computation.
$3
669322
650
2 4
$a
Mathematics of Computing.
$3
669457
650
2 4
$a
Computational Mathematics and Numerical Analysis.
$3
669338
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer Nature eBook
776
0 8
$i
Printed edition:
$z
9783662448076
776
0 8
$i
Printed edition:
$z
9783662448090
776
0 8
$i
Printed edition:
$z
9783662516010
856
4 0
$u
https://doi.org/10.1007/978-3-662-44808-3
912
$a
ZDB-2-SCS
912
$a
ZDB-2-SXCS
950
$a
Computer Science (SpringerNature-11645)
950
$a
Computer Science (R0) (SpringerNature-43710)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入