Theory of recursive functions and effective computability
Material type: TextPublication details: Cambridge, Mass. : MIT Press, ©1987.Description: xxi, 482 p. ; 23 cmISBN:- 9780262680523
- 511.3 19 ROG-T
- QA9.615 .R64 1987
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | Course reserves |
---|---|---|---|---|---|---|---|---|
Reference | IIITD Reference | Mathematics | REF 511.3 ROG-T (Browse shelf(Opens below)) | Not for loan | 005044 |
Total holds: 0
Browsing IIITD shelves, Shelving location: Reference, Collection: Mathematics Close shelf browser (Hides shelf browser)
REF 511.3 MAR-F First order mathematical logic | REF 511.3 PAP-C Computational complexity | REF 511.3 RIC-A Automata, computability and complexity : | REF 511.3 ROG-T Theory of recursive functions and effective computability | REF 511.3 RUC-I Infinity and the mind : | REF 511.3 SCH-L Logic for computer scientists | REF 511.3 SOA-R Recursively enumerable sets and degrees : |
Includes indexes.
Bibliography: p. 459-468.
There are no comments on this title.