On Alan Turing's anticipation of connectionism

Synthese 108 (3):361-377 (1996)
  Copy   BIBTEX

Abstract

It is not widely realised that Turing was probably the first person to consider building computing machines out of simple, neuron-like elements connected together into networks in a largely random manner. Turing called his networks unorganised machines. By the application of what he described as appropriate interference, mimicking education an unorganised machine can be trained to perform any task that a Turing machine can carry out, provided the number of neurons is sufficient. Turing proposed simulating both the behaviour of the network and the training process by means of a computer program. We outline Turing's connectionist project of 1948.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,038

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
137 (#135,249)

6 months
21 (#126,261)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jack Copeland
University of Canterbury

References found in this work

Computing machinery and intelligence.Alan M. Turing - 1950 - Mind 59 (October):433-60.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Cybernetics.Norbert Wiener - 1948 - New York,: M.I.T. Press.
A logical calculus of the ideas immanent in nervous activity.Warren S. McCulloch & Walter Pitts - 1943 - The Bulletin of Mathematical Biophysics 5 (4):115-133.

View all 20 references / Add more references