Automata StudiesPrinceton University Press, 1958 - 285 sivua |
Sisältö
Representation of Events in Nerve Nets and Finite Automata | 3 |
Probabilistic Logics and the Synthesis of Reliable Organisms From | 43 |
Some Uneconomical Robots | 99 |
Tekijänoikeudet | |
10 muita osia ei näytetty
Muita painoksia - Näytä kaikki
Yleiset termit ja lausekkeet
activity automata automaton b₁ basic organs Berkeley Berkeley c-s-machine C. E. Shannon CALIFORNIA LIBRARY 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 neurons input symbols integers internal Lemma lines logical majority organ mathematical memoryless N₂(p nerve nerve net nervous system 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 signals stimulated stochastic machine strongly p-enumerable subcontrol subset supercontrol synapse tape Theorem theory tion Turing machine unit universal Turing machine UNIVERSITY OF CALIFORNIA