Introduction to computability
Series: Addison-Wesley series in computer science and information processingPublication details: Reading,Massachusetts: Addison-Wesley, 1977. Description: ix, 374p. illISBN: 0201028484Subject(s): Turing machines | Computer algorithms | Computational complexity | Recursive functions![](/opac-tmpl/bootstrap/itemtypeimg/bridge/book.png)
Current library | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
Main Stack | Non Fiction | QA267 .H46 1977 (Browse shelf(Opens below)) | Available | BK0026133 |
Browsing Main shelves Close shelf browser (Hides shelf browser)
No cover image available | No cover image available | No cover image available | ||||||
QA263 .G353 1977 The theory of matrices | QA263 .G353 1977 The theory of matrices | QA267 .H33 1974 Introduction to computation theory | QA267 .H46 1977 Introduction to computability | QA267 .L49 1981 Elements of the theory of computation | QA267 .S58x 2008 Theory of automation and formal languages | QA267 .S58x 2008 Theory of automata and formal languages |
There are no comments on this title.