This publication is presented to you through Paradigm Publishing Services
Princeton University Press
Book
Licensed
Unlicensed
Requires Authentication
Automata Studies
-
Edited by:
C. E. Shannon
and J. McCarthy
Language:
English
Published/Copyright:
2016
About this book
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.
Topics
-
Download PDFPublicly Available
Frontmatter
i -
Download PDFRequires Authentication UnlicensedLicensed
Preface
v -
Download PDFPublicly Available
Contents
ix - Finite Automata
-
Download PDFRequires Authentication UnlicensedLicensed
Representation of Events in Nerve Nets and Finite Automata
3 -
Download PDFRequires Authentication UnlicensedLicensed
Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components
43 -
Download PDFRequires Authentication UnlicensedLicensed
Some Uneconomical Robots
99 -
Download PDFRequires Authentication UnlicensedLicensed
Some Universal Elements for Finite Automata
117 -
Download PDFRequires Authentication UnlicensedLicensed
Gedanken-Experiments on Sequential Machines
129 - Turing Machines
-
Download PDFRequires Authentication UnlicensedLicensed
A Universal Turing Machine with Two Internal States
157 -
Download PDFRequires Authentication UnlicensedLicensed
A Note on Universal Turing Machines
167 -
Download PDFRequires Authentication UnlicensedLicensed
The Inversion of Functions Defined by Turing Machines
177 -
Download PDFRequires Authentication UnlicensedLicensed
Computability by Probabilistic Machines
183 - Synthesis of Automata
-
Download PDFRequires Authentication UnlicensedLicensed
Design for an Intelligence-Amplifier
215 -
Download PDFRequires Authentication UnlicensedLicensed
The Epistemological Problem for Automata
235 -
Download PDFRequires Authentication UnlicensedLicensed
Conditional Probability Machines and Conditioned Reflexes
253 -
Download PDFRequires Authentication UnlicensedLicensed
Temporal and Spatial Patterns in a Conditional Probability Machine
277
Publishing information
Pages and Images/Illustrations in book
eBook published on:
June 6, 2016
eBook ISBN:
9781400882618
Pages and Images/Illustrations in book
eBook ISBN:
9781400882618
Keywords for this book
Probability; Automaton; Theorem; Turing machine; Computation; Mathematical induction; Calculation; Recursive set; Sign (mathematics); Instance (computer science); Entscheidungsproblem; Universal Turing machine; Algebraic theory; Abstraction (software engineering); Recursively enumerable set; A Mathematical Theory of Communication; Recursion (computer science); Variable (mathematics); Diagram (category theory); Circuit design; Function (mathematics); Number theory; Markov chain; Moore machine; Fixed point (mathematics); Moment (mathematics); String (computer science); Permutation; Description number; Series (mathematics); Proportionality (mathematics); Sheffer stroke; Boolean algebra (structure); Gödel numbering; Subset; Conditional probability; Axiom; Equation; Mathematics; Interlacing (bitmaps); Hardware random number generator; Sequence; Counting; Special case; Chaos theory; Heuristic argument; Logical disjunction; Logarithm; Deterministic system (philosophy); Schematic; Mathematical analysis; Set theory; Result; Decision problem; Classical conditioning; Intuitionistic logic; OR gate; Determinism; Parity (mathematics); Counterexample; Arithmetic; Polynomial; Concepts (C++); Mathematical theory; Parameter (computer programming); Combination; Propositional function; Mathematical logic; Notation; Exponentiation
Audience(s) for this book
For an expert adult audience, including professional development and academic research