Automata Studies: Annals of Mathematics Studies. Number 34Princeton University Press, 21. tra 1956. - Broj stranica: 285 A classic contribution to automata studies from the acclaimed Annals of Mathematics Studies series |
Sadržaj
Representation of Events in Nerve Nets and Finite Automata | 3 |
Probabilistic Logics and the Synthesis of Reliable Organisms From | 43 |
Some Uneconomical Robots | 99 |
Some Universal Elements for Finite Automata | 117 |
GedankenExperiments on Sequential Machines | 129 |
A Universal Turing Machine with Two Internal States | 157 |
A Note on Universal Turing Machines | 167 |
The Inversion of Functions Defined by Turing Machines | 177 |
Computability by Probabilistic Machines | 183 |
Design for an IntelligenceAmplifier | 215 |
The Epistemological Problem for Automata | 235 |
Conditional Probability Machines and Conditioned Reflexes | 253 |
Temporal and Spatial Patterns in a Conditional Probability Machine | 277 |
Ostala izdanja - Prikaži sve
Automata Studies: Annals of Mathematics Studies. Number 34 William Ross Ashby Ograničeni pregled - 1956 |
Uobičajeni izrazi i fraze
a₁ activity automata automaton basic organs c-s-machine C. E. Shannon central cell complete robot computable conditional probability machine considered construction corresponding defined definite event described digit disjunction distinguish elements empty set endbulbs enumerated equivalent error error-signal example excitatory experiment finite automaton finite number firing function given Hence infinite initial inner neurons input bundles input fibres input neurons input symbols integers internal Lemma lines logical M₂ majority organ memoryless N₁ N₂(p nerve nerve net nervous system non-initial occurs operation output symbols p-machine pattern possible prints problem proof propositional calculus random device reading head real number receptor recursive recursive function regular event regular expression representation represented response set of tables Sheffer organ Sheffer stroke shown in Figure stimulated stochastic machine strongly p-enumerable subcontrol subset supercontrol synapse tape Theorem theory tion Turing machine unconditioned stimulus unit universal Turing machine