語系:
繁體中文
English
日文
簡体中文
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Computability theory[electronic reso...
~
Enderton, Herbert B.
Computability theory[electronic resource] :an introduction to recursion theory /
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
杜威分類號:
511.3/5
書名/作者:
Computability theory : an introduction to recursion theory // Herbert B. Enderton.
作者:
Enderton, Herbert B.
出版者:
Amsterdam ; : Academic Press,, c2011.
面頁冊數:
174 p. : : ill. ;; 24 cm.
標題:
Recursion theory.
ISBN:
9780123849588 (electronic bk.)
ISBN:
9780123849588
書目註:
Includes bibliographical references (p. 163-164) and index.
內容註:
The Computability Concept -- General Recursive Functions -- Programs and Machines -- Recursive Enumerability -- Connections to Logic -- Degrees of Unsolvability -- Polynomial-Time Computability -- [Appendices]. Mathspeak -- Countability -- Decadic Notation.
電子資源:
http://www.sciencedirect.com/science/book/9780123849588
Computability theory[electronic resource] :an introduction to recursion theory /
Enderton, Herbert B.
Computability theory
an introduction to recursion theory /[electronic resource] :Herbert B. Enderton. - Amsterdam ;Academic Press,c2011. - 174 p. :ill. ;24 cm.
Includes bibliographical references (p. 163-164) and index.
The Computability Concept -- General Recursive Functions -- Programs and Machines -- Recursive Enumerability -- Connections to Logic -- Degrees of Unsolvability -- Polynomial-Time Computability -- [Appendices]. Mathspeak -- Countability -- Decadic Notation.
ISBN: 9780123849588 (electronic bk.)
LCCN: 2010038448Subjects--Topical Terms:
404770
Recursion theory.
LC Class. No.: QA9.6 / .E53 2011
Dewey Class. No.: 511.3/5
Computability theory[electronic resource] :an introduction to recursion theory /
LDR
:01008cam a22002294a 45
001
398167
005
20131126083506.0
008
140107s2011 ne a sb 001 0 eng
010
$a
2010038448
020
$a
9780123849588 (electronic bk.)
020
$a
9780123849588
035
$a
13000274
040
$a
DLC
$c
DLC
$d
DLC
041
0
$a
eng
042
$a
pcc
050
0 0
$a
QA9.6
$b
.E53 2011
082
0 0
$a
511.3/5
$2
22
100
1
$a
Enderton, Herbert B.
$3
553719
245
1 0
$a
Computability theory
$h
[electronic resource] :
$b
an introduction to recursion theory /
$c
Herbert B. Enderton.
260
$a
Amsterdam ;
$a
Boston :
$b
Academic Press,
$c
c2011.
300
$a
174 p. :
$b
ill. ;
$c
24 cm.
504
$a
Includes bibliographical references (p. 163-164) and index.
505
8
$a
The Computability Concept -- General Recursive Functions -- Programs and Machines -- Recursive Enumerability -- Connections to Logic -- Degrees of Unsolvability -- Polynomial-Time Computability -- [Appendices]. Mathspeak -- Countability -- Decadic Notation.
650
0
$a
Recursion theory.
$3
404770
856
4 0
$u
http://www.sciencedirect.com/science/book/9780123849588
筆 0 讀者評論
多媒體
多媒體檔案
http://www.sciencedirect.com/science/book/9780123849588
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入