06.09.2021 Views

Mind, Body, World- Foundations of Cognitive Science, 2013a

Mind, Body, World- Foundations of Cognitive Science, 2013a

Mind, Body, World- Foundations of Cognitive Science, 2013a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

How does a Turing machine generate answers to the written questions? A<br />

Turing machine consists <strong>of</strong> a machine head whose actions are governed by a set<br />

<strong>of</strong> instructions called the machine table. The machine head will also be in one <strong>of</strong><br />

a set <strong>of</strong> possible physical configurations called machine states. The machine head<br />

reads a symbol on the tape. This symbol, in combination with the current machine<br />

state, determines which machine table instruction to execute next. An instruction<br />

might tell the machine head to write a symbol, or to move one cell to the left or<br />

the right along the tickertape. The instruction will also change the machine head’s<br />

machine state.<br />

A Turing machine does not answer questions instantly. Instead, it takes its<br />

time, moving back and forth along the tape, reading and writing symbols as it<br />

works. A long sequence <strong>of</strong> actions might be observed and recorded, such as “First<br />

the machine head moves four cells to the right. Then it stops, and replaces the 1 on<br />

the tape with a 0. Then it moves three cells to the left.”<br />

The record <strong>of</strong> the observed Turing machine behaviours would tell us a great<br />

deal about its design. Descriptions such as “When given Question A, the machine<br />

generated Answer X” would provide information about the input-output mapping<br />

that the Turing machine was designed to achieve. If we were also able to watch<br />

changes in machine states, more detailed observations would be possible, such as<br />

“If the machine head is in State 1 and reads a ‘1’ on the tape, then it moves one cell<br />

left and adopts State 6.” Such observations would provide information about the<br />

machine table that was designed for this particular device’s machine head.<br />

Not all Turing machine behaviours occur by design; some behaviours are artifacts.<br />

Artifacts occur because <strong>of</strong> the device’s design but are not explicitly part <strong>of</strong> the<br />

design (Pylyshyn, 1980, 1984). They are unintentional consequences <strong>of</strong> the designed<br />

procedure.<br />

For instance, the Turing machine takes time to add two numbers together;<br />

the time taken will vary from question to question. The amount <strong>of</strong> time taken to<br />

answer a question is a consequence <strong>of</strong> the machine table, but is not intentionally<br />

designed into it. The time taken is an artifact because Turing machines are designed<br />

to answer questions (e.g., “What is the sum <strong>of</strong> these two integers?”); they are not<br />

explicitly designed to answer questions in a particular amount <strong>of</strong> time.<br />

Similarly, as the Turing machine works, the ticker tape adopts various intermediate<br />

states. That is, during processing the ticker tape will contain symbols that are<br />

neither the original question nor its eventual answer. Answering a particular question<br />

will produce a sequence <strong>of</strong> intermediate tape states; the sequence produced<br />

will also vary from question to question. Again, the sequence <strong>of</strong> symbol states is an<br />

artifact. The Turing machine is not designed to produce a particular sequence <strong>of</strong><br />

intermediate states; it is simply designed to answer a particular question.<br />

42 Chapter 2

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!