Computability, Enumerability, unsolvability directions in recursion theory
Material type:
TextLanguage: English Series: London Mathematical Society lecture note series; 224Publication details: Cambridge CUP 1996Description: vii,347pISBN: - 0-521-55736-4
- 511.35 C778
| Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|
| Books | ISI Library, Kolkata NBHM Collection | 511.35 C778 (Browse shelf(Opens below)) | Available | 117907 |
Total holds: 0
Browsing ISI Library, Kolkata shelves, Shelving location: NBHM Collection Close shelf browser (Hides shelf browser)
| 511.33 R758 Lattices and ordered sets | 511.33 St839 Semimodular lattices | 511.34 V111 Models and games | 511.35 C778 Computability, Enumerability, unsolvability | 511.35 G578 Introducing the theory of computation | 511.35 K23 Recursion theory and complexity | 511.35 Sa121 Higher recursion theory |
This volume is a collection of articles commemorating the Leeds recursion theory year 1993-94
There are no comments on this title.
Log in to your account to post a comment.
