5 ;;Quote: a paper machine for playing chess acts as if it were alive; it is difficult to distinguish from a rather poor chess player

7 ;;Quote: with a universal Turing machine, you can program it for each different job

7 ;;Quote: logical computing machines can do anything described as 'rule of thumb' or 'purely mechanical'; other constructions are mathematically equivalent

7 ;;Quote: physical limitations bound the number of steps in a computation; about 10^20 steps and 10^20 memory elements

8 ;;Quote: practical computing machines dial the position of information in a store; delay of a few microseconds; most are universal

9 ;;Quote: an unorganized machine has a large number of randomly connected, similar units (e.g., NAND gates); simple model of nervous system

11 ;;Quote: turn networks of NAND gates into components that, depending on initial conditions, invert signal, always 1, or alternate; training can create a universal Turing equivalent

12 ;;Quote: produce a thinking machine by imitating each part and letting it roam the countryside; too slow and too large to be practical

16 ;;Quote: an infant's mind is an unorganized machine; with training could produce a universal machine, or a more normal type of mind

17 ;;Quote: Turing created a universal machine by training, on paper, an unorganized machine with rewards and punishments; circular memory of 64 squares