| Titre : |
Computation : finite and infinite machines |
| Type de document : |
texte imprimé |
| Auteurs : |
Minsky, Marvin Lee, Auteur |
| Editeur : |
London ; New Jersey : Prentice-Hall |
| Année de publication : |
1967 |
| Collection : |
automatic computation |
| Importance : |
XVII, 317 p. |
| Présentation : |
ill. |
| Format : |
23 cm |
| Note générale : |
Bibliogr. p. 301-308. - Index |
| Langues : |
Anglais (eng) |
| Mots-clés : |
Machine theory
Intelligence artificielle
Automates mathématiques, Théorie des
Machines séquentielles, Théorie des
Fonctions récursives |
| Index. décimale : |
681.325.5 Dispositifs, machines ou éléments arithmétiques (de calcul) |
| Note de contenu : |
Summary :
I. Finite-state machines
1. Finite-state machines
2. Neural networks. Automata made up of parts
3. The memories of events in finite-state machines
II. Infinite machines
4. Computability, effective procesdures, and algorithms. Infinite machines
5. Turing machines
6. Universal turing machines
7. Limitations of effective computability : some problems not solvable by instruction-obeying machines
8. The computable real numbers
9. The relations between turing machines and recursive functions
10. Models similar to digital computers
III. Symbol-manipulation systems and computability
11. The symbol-manipulation systems of post
12. Post's normal-form theorem
13. Very simple bases for computability
14. Solutions to selected problems |
Computation : finite and infinite machines [texte imprimé] / Minsky, Marvin Lee, Auteur . - London ; New Jersey : Prentice-Hall, 1967 . - XVII, 317 p. : ill. ; 23 cm. - ( automatic computation) . Bibliogr. p. 301-308. - Index Langues : Anglais ( eng)
| Mots-clés : |
Machine theory
Intelligence artificielle
Automates mathématiques, Théorie des
Machines séquentielles, Théorie des
Fonctions récursives |
| Index. décimale : |
681.325.5 Dispositifs, machines ou éléments arithmétiques (de calcul) |
| Note de contenu : |
Summary :
I. Finite-state machines
1. Finite-state machines
2. Neural networks. Automata made up of parts
3. The memories of events in finite-state machines
II. Infinite machines
4. Computability, effective procesdures, and algorithms. Infinite machines
5. Turing machines
6. Universal turing machines
7. Limitations of effective computability : some problems not solvable by instruction-obeying machines
8. The computable real numbers
9. The relations between turing machines and recursive functions
10. Models similar to digital computers
III. Symbol-manipulation systems and computability
11. The symbol-manipulation systems of post
12. Post's normal-form theorem
13. Very simple bases for computability
14. Solutions to selected problems |
|
