What people are saying - Write a review
We haven't found any reviews in the usual places.
Representation of Events in Nerve Nets and Finite Automata
Probabilistic Logics and the Synthesis of Reliable Organisms From
Some Uneconomical Robots
10 other sections not shown
Other editions - View all
activity automata automaton basic organs c-s-machine C. E. Shannon central cell complete complete robot components computable conditional probability machine conditioned stimulus considered construction corresponding defined definite event delay described digit disjunction distinguish elements empty set endbulbs enumerated equivalent error error-signal example experiment finite automaton finite number firing given Hence induction infinite initial inner neurons input bundles input fibres input neurons input symbols internal Lemma length lines logical majority organ mathematical memoryless robot n-tuple nerve nets nervous system normally distributed occurs operation output symbols p-machine pattern possible prints problem proof propositional calculus pulse random device reading head real number receptor 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 variables