Please use this identifier to cite or link to this item:
http://rguir.inflibnet.ac.in:8080/jspui/handle/123456789/14192
Title: | Computability theory |
Other Titles: | Chapman & Hall/CRC mathematics |
Authors: | Cooper, S. Barry |
Keywords: | Computable functions= Coding, Self-Reference and the Universal Turing Machine Enumerability G¨odel’s Incompleteness Theorem Decidable and Undecidable Theories Computing with Oracles Nondeterminism, Enumerations and Polynomial Bounds |
Issue Date: | 2004 |
Publisher: | CRC Press / Taylor & Francis Group |
Series/Report no.: | CHAPMAN & HALL/CRC MATHEMATICS; |
URI: | http://rguir.inflibnet.ac.in:8080/jspui/handle/123456789/14192 |
ISBN: | 1-58488-237-9 |
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.