Computability : Turing, Godel, Church, and beyond
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
- 9780262018999
- 511.352 23 COP-C
- QA267.7 .C677 2013
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
![]() |
IIITD Reference | Mathematics | REF 511.352 COP-C (Browse shelf(Opens below)) | Available | 003622 |
Total holds: 0
Browsing IIITD shelves, Shelving location: Reference, Collection: Mathematics Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
REF 511.33 BRE-L Lattice basis reduction : | REF 511.35 ARO-C Computational complexity : | REF 511.35 HOP-I Introduction to automata theory, languages, and computation | REF 511.352 COP-C Computability : | REF 511.352 FOR-G The golden ticket : | REF 511.352 GOL-C Computational complexity : | REF 511.352 JUK-B Boolean function complexity : |
Includes bibliographical references and index.
There are no comments on this title.