Automata Studies

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): C. E. Shannon (ed.), J. McCarthy (ed.)
Series: Annals of Mathematics Studies, Volume 34
Publisher: Princeton University Press
Year: 1956

Language: English
Pages: 285

CONTENTS
Preface
FINITE AUTOMATA
Representation of Events in Nerve Nets and Finite Automata
Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components
Some Uneconomical Robots
Some Universal Elements for Finite Automata
Gedanken-Experiments on Sequential Machines
TURING MACHINES
A Universal Turing Machine with Two Internal States
A Note on Universal Turing Machines
The Inversion of Functions Defined by Turing Machines
Computability by Probabilistic Machines
SYNTHESIS OF AUTOMATA
Design for an Intelligence-Amplifier
The Epistemological Problem for Automata
Conditional Probability Machines and Conditioned Reflexes
Temporal and Spatial Patterns in a Conditional Probability Machine