國立高雄大學圖資館 |

Language: English

圖資館首頁

Login

Back

Switch To: Labeled | MARC Mode | ISBD

Computability theoryan introduction ...

~

Enderton, Herbert B.

Computability theoryan introduction to recursion theory /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Computability theoryHerbert B. Enderton.
Reminder of title:	an introduction to recursion theory /
Author:	Enderton, Herbert B.
Published:	Amsterdam ;Academic Press,c2011.
Description:	174 p. :ill. ;24 cm.
Subject:	Recursion theory.
Online resource:	http://www.sciencedirect.com/science/book/9780123849588
ISBN:	9780123849588 (electronic bk.)

Computability theoryan 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:

268912
Recursion theory.

LC Class. No.: QA9.6 / .E53 2011

Dewey Class. No.: 511.3/5

Computability theoryan introduction to recursion theory /
LDR:01008cmm a22002294a 45 001 404734
005 20131126083506.0
008 140120s2011 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 646557
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 268912
856 4 0 $u http://www.sciencedirect.com/science/book/9780123849588

based on 0 review(s)

Items

1 records • Pages 1 •
1

Inventory Number

No. of reservations

000000091078

電子館藏

1圖書

電子書

EB QA9.6 E53 c2011

一般使用(Normal)

On shelf

0

1 records • Pages 1 •
1

Multimedia

Multimedia file
http://www.sciencedirect.com/science/book/9780123849588

Reviews

Add a review and share your thoughts with other readers

Export

pickup library

Change password

Login