|
" Computability theory : "
Herbert B. Enderton
Document Type
|
:
|
BL
|
Record Number
|
:
|
183299
|
Doc. No
|
:
|
b92304
|
|
:
|
GBB0B0040
|
Main Entry
|
:
|
Enderton, Herbert B
|
Title & Author
|
:
|
Computability theory : : an introduction to recursion theory /\ Herbert B. Enderton
|
Page. NO
|
:
|
viii, 174 pages :: illustrations ;; 24 cm
|
ISBN
|
:
|
9780123849588 (hardback)
|
|
:
|
: 0123849586 (hardback)
|
Bibliographies/Indexes
|
:
|
Includes bibliographical references and index
|
Contents
|
:
|
The computability concept -- General recursive functions -- Programs and machines -- Recursive enumerability -- Connections to logic -- Degrees of unsolvability -- Polynomial-time computability -- A1: Mathspeak -- A2: Countability -- A3: Decadic Notation
|
Subject
|
:
|
Recursion theory
|
Dewey Classification
|
:
|
511.3/5
|
LC Classification
|
:
|
QA9.6.E53 2011
|
| |