 (McDermott (2014) calculates that a look-up table for a participant who makes 50 conversational exchanges would have about 1022278 nodes. It is tempting to take this calculation to establish that it is neither nomically nor physically possible for there to be a “hand simulation” of a Turing Test program, on the grounds that the required number of nodes could not be fitted into a space much much larger than the entire observable universe.)