Digital Library at Rajiv Gandhi University, Arunachal Pradesh
The Digital Library at Rajiv Gandhi University, Arunachal Pradesh is an online emplacement for collecting, preserving, and disseminating the institute's quality teaching research and extension output to the Global community.
Please use this identifier to cite or link to this item:
http://rguir.inflibnet.ac.in:8080/jspui/handle/123456789/14192Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Cooper, S. Barry | - |
| dc.date.accessioned | 2022-12-08T10:35:18Z | - |
| dc.date.available | 2022-12-08T10:35:18Z | - |
| dc.date.issued | 2004 | - |
| dc.identifier.isbn | 1-58488-237-9 | - |
| dc.identifier.uri | http://rguir.inflibnet.ac.in:8080/jspui/handle/123456789/14192 | - |
| dc.language.iso | en | en_US |
| dc.publisher | CRC Press / Taylor & Francis Group | en_US |
| dc.relation.ispartofseries | CHAPMAN & HALL/CRC MATHEMATICS; | - |
| dc.subject | Computable functions= Coding, Self-Reference and the Universal Turing Machine | en_US |
| dc.subject | Enumerability | en_US |
| dc.subject | G¨odel’s Incompleteness Theorem | en_US |
| dc.subject | Decidable and Undecidable Theories | en_US |
| dc.subject | Computing with Oracles | en_US |
| dc.subject | Nondeterminism, Enumerations and Polynomial Bounds | en_US |
| dc.title | Computability theory | en_US |
| dc.title.alternative | Chapman & Hall/CRC mathematics | en_US |
| dc.type | Book | en_US |
| Appears in Collections: | Mathematics | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Computability Theory.pdf Restricted Access | 3.76 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.