Language:
English
繁體中文
Help
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Computability theory = an introducti...
~
Enderton, Herbert B.
Computability theory = an introduction to recursion theory /
Record Type:
Language materials, printed : Monograph/item
Title/Author:
Computability theory/ Herbert 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 theory = 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:
575916
Recursion theory.
LC Class. No.: QA9.6 / .E53 2011
Dewey Class. No.: 511.3/5
Computability theory = an introduction to recursion theory /
LDR
:01008cam a22002294a 45
001
776888
005
20131126083506.0
008
140224s2011 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
903021
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
575916
856
4 0
$u
http://www.sciencedirect.com/science/book/9780123849588
based on 0 review(s)
Multimedia
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login