Automata Studies: Annals of Mathematics Studies. Number 34

Etukansi
Princeton University Press, 21.4.1956 - 285 sivua

A classic contribution to automata studies from the acclaimed Annals of Mathematics Studies series

Princeton University Press is proud to have published the Annals of Mathematics Studies since 1940. One of the oldest and most respected series in science publishing, it has included many of the most important and influential mathematical works of the twentieth century. The series continues this tradition as Princeton University Press publishes the major works of the twenty-first century.

To mark the continued success of the series, all books are available in paperback and as ebooks.

 

Sisältö

Representation of Events in Nerve Nets and Finite Automats
3
Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components
43
Some Uneconomical Robots
99
Some Universal Elements for Finite Automata
117
GedankenExperiments on Sequential Machines
129
TURING MACHINES
155
A Universal Turning Machine with Two Internal States
157
A Note on Universal Turing Machines
167
The Inversion of Functions Defined by Turning Machines
177
Computability by Probabilistic Machines
183
SYNTHESIS OF AUTOMATA
213
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
Tekijänoikeudet

Muita painoksia - Näytä kaikki

Automata Studies: Annals of Mathematics Studies. Number 34
William Ross Ashby
Rajoitettu esikatselu - 1956
Automata Studies. (AM-34), Volume 34
C. E. Shannon,J. McCarthy
Rajoitettu esikatselu - 2016
Automata Studies. (AM-34), Volume 34
William Ross Ashby
Esikatselu ei käytettävissä - 1956

Yleiset termit ja lausekkeet

activity automaton basic organs c-s-machine C. E. Shannon central cell complete robot components 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 automata finite number firing given Hence induction infinite initial inner neurons input bundles input fibres input neurons input symbols integers internal Lemma length lines logical majority organ memoryless N₂(p nerve net nervous system non-initial 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 threshold tion unit universal Turing machine variables

Viitteet tähän teokseen

Kirjaluettelon tiedot

OtsikkoAutomata Studies: Annals of Mathematics Studies. Number 34
Numero 34 / Annals of Mathematics Studies, ISSN 0066-2313
Goldstine Printed Materials
KirjoittajaWilliam Ross Ashby
ToimittajatC. E. Shannon, J. McCarthy
KustantajaPrinceton University Press, 1956
ISBN0691079161, 9780691079165
Pituus285 sivua
  
Vie sitaattiBiBTeX EndNote RefMan