DSpace JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn More
Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/1/6103Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Enderton, Herbert B | - |
| dc.date.accessioned | 2017-01-30T11:24:31Z | - |
| dc.date.available | 2017-01-30T11:24:31Z | - |
| dc.date.issued | 2011 | - |
| dc.identifier.uri | http://hdl.handle.net/123456789/153544 | - |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/1/6103 | - |
| dc.description | 176 p. | en_US |
| dc.description.abstract | Computability Theory: An Introduction to Recursion Theory, provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier | en_US |
| dc.subject | Recursion theory. | en_US |
| dc.title | Computability theory : an introduction to recursion theory$dHerbert B. Enderton | en_US |
| dc.type | Book | en_US |
| Appears in Collections: | Open Access Books | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.