Computation : finite and infinite machines /
Guardado en:
| Autor Principal: | |
|---|---|
| Formato: | Libro |
| Idioma: | English |
| Publicado: |
Englewood Cliffs, N.J. :
Prentice-Hall,
c1967.
|
| Series: | Prentice-Hall series in automatic computation
|
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| LEADER | 01514nam a22002055 4500 | ||
|---|---|---|---|
| 001 | MAT.inmabb001811 | ||
| 008 | 740410s1967####njua#####b####001#0#eng#d | ||
| 005 | 20130406185019.0 | ||
| 245 | 1 | 0 | |a Computation : |b finite and infinite machines / |c Marvin L. Minsky. |
| 260 | |a Englewood Cliffs, N.J. : |b Prentice-Hall, |c c1967. | ||
| 300 | |a xvii, 317 p. : |b il. ; |c 24 cm. | ||
| 440 | 0 | |a Prentice-Hall series in automatic computation | |
| 504 | |a Bibliografía: p. 301-308. | ||
| 505 | 8 | |a Lista de secciones: 1. Physical machines and their abstract counterparts -- 2. Finite-state machines -- 3. Neural networks. Automata made up of parts -- 4. The memories of events in finite-state machines -- 5. Computability, effective procedures, and algorithms. Infinite machines -- 6. Turing machines -- 7. Universal Turing machines -- 8. Limitations of effective computability: some problems not solvable by instruction-obeying machines -- 9. The computable real numbers -- 10. The relations between Turing machines and recursive functions -- 11. Models similar to digital computers -- 12. The symbol-manipulation systems of Post -- 13. Post's normal-form theorem -- 14. Very simple bases for computability -- 15. Solutions to selected problems -- 16. Suggestions for further reading and descriptor-indexed bibliography. | |
| 510 | 4 | |a MR, |c 50 #9050 | |
| 100 | 1 | |a Minsky, Marvin Lee, |d 1927- | |
| 084 | |a 68Qxx |2 msc2000 | ||
| 010 | |a 67012342 | ||
| 859 | |h 68 |i M666 |p A-3285 |b BIB. MATEMATICA | ||
| 859 | |h 68 |i M666 |p A-3376 |t Ej. 2 |b BIB. MATEMATICA | ||