On Alan Turing's Anticipation of Connectionism

Synthese 108:361-367 (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: 91,386

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

Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
What Turing did after he invented the universal Turing machine.Diane Proudfoot & Jack Copeland - 2000 - Journal of Logic, Language and Information 9:491-509.
Turing's golden: How well Turing's work stands today.Justin Leiber - 2006 - Philosophical Psychology 19 (1):13-46.
Alan Turing and the mathematical objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
The broad conception of computation.Jack Copeland - 1997 - American Behavioral Scientist 40 (6):690-716.
Undecidability in the imitation game.Y. Sato & T. Ikegami - 2004 - Minds and Machines 14 (2):133-43.
The Turing test.B. Jack Copeland - 2000 - Minds and Machines 10 (4):519-539.

Analytics

Added to PP
2013-09-30

Downloads
85 (#194,716)

6 months
12 (#200,125)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Diane Proudfoot
University of Canterbury
Jack Copeland
University of Canterbury

Citations of this work

What is computation?B. Jack Copeland - 1996 - Synthese 108 (3):335-59.
Triviality arguments against functionalism.Peter Godfrey-Smith - 2009 - Philosophical Studies 145 (2):273 - 295.
The philosophy of computer science.Raymond Turner - 2013 - Stanford Encyclopedia of Philosophy.

View all 21 citations / Add more citations

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.
Design for a Brain.W. Ross Ashby - 1953 - British Journal for the Philosophy of Science 4 (14):169-173.

View all 15 references / Add more references