Introduction to computability /
Guardado en:
| Autor Principal: | |
|---|---|
| Formato: | Libro |
| Idioma: | English |
| Publicado: |
Reading, Mass. :
Addison-Wesley,
c1977.
|
| Series: | Addison-Wesley series in computer science and information processing
|
| Materias: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| LEADER | 01039cam a2200265 a 4500 | ||
|---|---|---|---|
| 001 | MAT.inmabb002755 | ||
| 008 | 780208s1977####maua#####b####001#0#eng## | ||
| 005 | 20130312123029.0 | ||
| 245 | 1 | 0 | |a Introduction to computability / |c Fred Hennie. |
| 260 | |a Reading, Mass. : |b Addison-Wesley, |c c1977. | ||
| 300 | |a ix, 374 p. : |b il. ; |c 25 cm. | ||
| 490 | 0 | |a Addison-Wesley series in computer science and information processing | |
| 504 | |a Bibliografía: p. 363-364. | ||
| 505 | 8 | |a Capítulos: 1. Properties of algorithmic computation -- 2. Turing machines -- 3. Turing computability -- 4. Primitive recursive functions -- 5. Recursive functions -- 6. Computability and decidability. | |
| 510 | 4 | |a MR, |c 56 #11767 | |
| 020 | |a 0201028484 | ||
| 100 | 1 | |a Hennie, Frederick C. | |
| 650 | 0 | |a Turing machines. | |
| 650 | 0 | |a Computer algorithms. | |
| 650 | 0 | |a Computational complexity. | |
| 650 | 0 | |a Recursive functions. | |
| 084 | |a 03D10 (68Q05) |2 msc2000 | ||
| 010 | |a 76012796 | ||
| 040 | |a DLC |c DLC |d DLC | ||
| 859 | |h 03 |i H516 |p A-5202 |b BIB. MATEMATICA | ||