Automata Studies
1st Edition
Published on 6. June 2016
285 pages
978-1-4008-8261-8 (ISBN)
Description
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.
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.
More details
Other editions
Additional editions
C. E. Shannon | J. McCarthy
Automata Studies
Book
04/1956
Princeton University Press
€85.20
Article not available at the moment
Persons
Edited by C.E. Shannon & J. McCarthy
Content
Frontmatter, pg. i
Preface, pg. v
Contents, pg. ix
Representation of Events in Nerve Nets and Finite Automata, pg. 3
Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components, pg. 43
Some Uneconomical Robots, pg. 99
Some Universal Elements for Finite Automata, pg. 117
Gedanken-Experiments on Sequential Machines, pg. 129
A Universal Turing Machine with Two Internal States, pg. 157
A Note on Universal Turing Machines, pg. 167
The Inversion of Functions Defined by Turing Machines, pg. 177
Computability by Probabilistic Machines, pg. 183
Design for an Intelligence-Amplifier, pg. 215
The Epistemological Problem for Automata, pg. 235
Conditional Probability Machines and Conditioned Reflexes, pg. 253
Temporal and Spatial Patterns in a Conditional Probability Machine, pg. 277
Preface, pg. v
Contents, pg. ix
Representation of Events in Nerve Nets and Finite Automata, pg. 3
Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components, pg. 43
Some Uneconomical Robots, pg. 99
Some Universal Elements for Finite Automata, pg. 117
Gedanken-Experiments on Sequential Machines, pg. 129
A Universal Turing Machine with Two Internal States, pg. 157
A Note on Universal Turing Machines, pg. 167
The Inversion of Functions Defined by Turing Machines, pg. 177
Computability by Probabilistic Machines, pg. 183
Design for an Intelligence-Amplifier, pg. 215
The Epistemological Problem for Automata, pg. 235
Conditional Probability Machines and Conditioned Reflexes, pg. 253
Temporal and Spatial Patterns in a Conditional Probability Machine, pg. 277
