大葉大學圖書館 |

言語: 日文

Computability theory[electronic reso...

Enderton, Herbert B.

Computability theory[electronic resource] :an introduction to recursion theory /

レコード種別:	言語・文字資料 (印刷物) : 単行資料
[NT 15000414] null:	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
[NT 15000227] null:	Includes bibliographical references (p. 163-164) and index.
[NT 15000228] null:	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 theoryan 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

マルチメディア (複合媒体資料)

マルチメディアファイル
http://www.sciencedirect.com/science/book/9780123849588

論評

Export

受取館