Introduction to computability / Fred Hennie.
Series Addison-Wesley series in computer science and information processingEditor: Reading, Mass. : Addison-Wesley, c1977Descripción: ix, 374 p. : il. ; 25 cmISBN: 0201028484Tema(s): Turing machines | Computer algorithms | Computational complexity | Recursive functionsOtra clasificación: 03D10 (68Q05)
Contenidos:
Capítulos: 1. Properties of algorithmic computation2. Turing machines3. Turing computability4. Primitive recursive functions5. Recursive functions6. Computability and decidability.
| Item type | Home library | Shelving location | Call number | Materials specified | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
Libros
|
Instituto de Matemática, CONICET-UNS | Libros ordenados por tema | 03 H516 (Browse shelf) | Available | A-5202 |
Browsing Instituto de Matemática, CONICET-UNS shelves, Shelving location: Libros ordenados por tema Close shelf browser
Bibliografía: p. 363-364.
Capítulos: 1. Properties of algorithmic computation -- 2. Turing machines -- 3. Turing computability -- 4. Primitive recursive functions -- 5. Recursive functions -- 6. Computability and decidability.
MR, 56 #11767
Click on an image to view it in the image viewer
There are no comments on this title.