Image from Amazon.com
Computability, enumerability, unsolvability: directions in recursion theory/ edited by S.B. Cooper, T.A. Slaman, S.S. Wainer.
Series: London mathematical society lecture note series ; 224Publication details: Cambridge [England] : Cambridge University Press, 1996.Description: vii, 347 p. ; 23 cmISBN:- 0521557364 (pbk.)
- QA9.6 C64 1996
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
Books
|
Main | QA9.6 C64 1996 (Browse shelf(Opens below)) | 1 | Withdrawn | 0001531 |
Browsing Main shelves Close shelf browser (Hides shelf browser)
| No cover image available |
|
|
|
No cover image available |
|
|
||
| QA9 .C63 1946 The common sense of the exact sciences, | QA9.58 K67 1994 Recombination variability and evolution: | QA9.58 K67 1994 Recombination variability and evolution: | QA9.6 C64 1996 Computability, enumerability, unsolvability: | QA37 .N64 1958 College mathematics / | QA39.2 C34 1977 Finite mathematics and calculus: | QA39.2 C34 1977 Finite mathematics and calculus: |
Includes bibliographical references and index.
1
There are no comments on this title.
Log in to your account to post a comment.