Computation : finite and infinite machines
Marvin L. Minsky.
Englewood Cliffs, N.J. : Prentice-Hall, ©1967.
xvii, 317 págs. : ilustraciones ; 24 cm.
Serie: Prentice-Hall series in automatic computation
Bibliografía: p. 301-308.
Reseña: MathSciNet, 50 #9050
Contenido
- 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.