The Turing Guide

514 | NOTES TO PAGES 306–316

22. In Proudfoot (2013) (Note 1), pp. 401–2, the schema I propose is world-relativized.


23. G. Jefferson, ‘The mind of mechanical man’, British Medical Journal, 1(4616) (1949), 1105–10,
    pp. 1109–10 and 1107.


24. Turing (1951), p. 484.


25. Turing (1951), p. 485.


26. The argument in the last section is developed in in D. Proudfoot, ‘Turing and free will: a new take
    on an old debate’, in J. Floyd and A. Bokulich (eds), Philosophical Explorations of the Legacy of Alan
    Turing, Boston Studies in the Philosophy and History of Science (in press).

CHAPTER 29 CONNECTIONISm: COmPUTING wITH NEURONS (COPElAND
AND PROUDfOOT)

1. This chapter consists of part of our article ‘Alan Turing’s forgotten ideas in computer science’, Scientific
   American, 280 (April 1999), 99–103, with minor additions and modifications. We are grateful to the
   editors of Scientific American for permission to reproduce this material here.


2. D. E. Rumelhart and J. L. McClelland, ‘On learning the past tenses of English verbs’, in J. L. McClelland,
   D. E. Rumelhart, and the PDP Research Group, Parallel Distributed Processing: Explorations in the
   Microstructure of Cognition, Vol. 2: Psychological and Biological Models, MIT Press (1986), 216–71.


3. F. Rosenblatt, ‘The Perceptron, a perceiving and recognizing automaton’, Report no. 85–460–1, Cornell
   Aeronautical Laboratory (1957); ‘The Perceptron: a probabilistic model for information storage and
   organisation in the brain’, Psychological Review, 65 (1958), 386–408; Principles of Neurodynamics,
   Spartan (1962).


4. Turing (1948).


5. Robin Gandy in an interview with Jack Copeland, October 1995; minutes of the Executive Committee
   of the National Physical Laboratory for 28 September 1948, National Physical Laboratory Library;
   a digital facsimile is available in The Turing Archive for the History of Computing (http://www.
   AlanTuring.net/npl_minutes_sept1948).


6. In C. R. Evans and A. D. J. Robertson, Key Papers: Cybernetics, Butterworth (1968).


7. Turing (1948), p. 422.


8. Turing (1948), p. 424.


9. Rosenblatt (1958) (Note 3), p. 387.


10. Copeland, ‘Enigma’, in The Essential Turing, pp. 254–5.


11. Turing (1948), p. 428.


12. B. G. Farley and W. A. Clark, ‘Simulation of self-organizing systems by digital computer’, Institute of
    Radio Engineers Transactions on Information Theory, 4 (1954), 76–84; W. A. Clark and B. G. Farley,
    ‘Generalization of pattern recognition in a self-organizing system’, in AFIPS ’55 (Western): Proceedings
    of the March 1–3, 1955, Western Joint Computer Conference, ACM (1955), 86–91.


13. For further information about Turing’s connectionist networks, see: B. J. Copeland and D. Proudfoot,
    ‘On Alan Turing’s anticipation of connectionism’, Synthese, 108 (1996), 361–77; B. J. Copeland and D.
    Proudfoot, ‘Turing and the computer’, in Copeland et al. (2005); C. Teuscher, Turing’s Connectionism:
    an Investigation of Neural Network Architectures, Springer (2002).

CHAPTER 30 CHIlD mACHINES (PROUDfOOT)

1. Turing (1950), p. 460.


2. Turing (1948), pp. 431, 422. Turing considered two options for constructing a child machine: build
   as simple a child machine as possible, or build one with a great deal of programming, such as ‘a
   complete system of logical inference’ (Turing (1950), p. 461). In the latter case, the machine would
   have ‘imperatives’—for example, if the teacher said ‘Do your homework now’, the machine would do
   the homework (Turing (1950), pp. 461–2).


3. Turing (1950), pp. 460–1; Turing (1948), pp. 429, 430; Turing (1947), p. 393; Turing (1948), p. 412.


4. Turing (1948), p. 420; Turing (1950), p. 463; Turing (1948), pp. 431–2.