Turing Machines, Finite Automata and Neural Nets

Authors:
Michael Arbib
Affiliations:
Massachusetts Institute of Technology, Cambridge, Mass and Sydney, Australia
Venue:
Journal of the ACM (JACM)
Year:
1961

Citing 1
Cited 2

Realization of Events by Logical Nets

Journal of the ACM (JACM)

Simulation of biological cells by systems composed of string-processing finite automata

AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
From mirror writing to mirror neurons

SAB'10 Proceedings of the 11th international conference on Simulation of adaptive behavior: from animals to animats

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper1 compares the notions of Turing machine, finite automaton and neural net. A new notation is introduced to replace net diagrams. “Equivalence” theorems are proved for nets with receptors, and finite automata; and for nets with receptors and effectors, and Turing machines. These theorems are discussed in relation to papers of Copi, Elgot and Wright; Rabin and Scott; and McCulloch and Pitts. It is shown that sets of positive integers “accepted” by finite automata are recursive; and a strengthened form of a theorem of Kleene is proved.