02.03.2013 Views

Thinking and Deciding

Thinking and Deciding

Thinking and Deciding

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

KNOWLEDGE, THINKING, AND UNDERSTANDING 25<br />

to which it refers. An example would be a formula for the area that reduced to the<br />

simple formula only by some algebraic manipulation:<br />

A =<br />

(b − h)<br />

(1/h − 1/b)<br />

Another way to put this, perhaps, is that the process that leads to underst<strong>and</strong>ing will<br />

fail to learn what cannot be understood. This process is unlikely to accept falsehood,<br />

even when propounded by authority, because falsehood is usually incomprehensible.<br />

4 Of course, many facts are essentially arbitrary, so that “underst<strong>and</strong>ing,” in the<br />

sense in which we are using the term, is impossible. A statement such as this — “The<br />

Battle of Hastings was fought in 1066” — must be accepted without underst<strong>and</strong>ing.<br />

Katona (1940), a follower of Wertheimer, made several additional observations<br />

concerning the relation between underst<strong>and</strong>ing <strong>and</strong> learning. Katona taught subjects<br />

how to solve different kinds of problems under various conditions, some designed<br />

to promote underst<strong>and</strong>ing <strong>and</strong> others designed not to do so. Certain of his problems<br />

concerned rearranging squares made of matchsticks so that a different number of<br />

squares could be made from the same number of matchsticks with a minimal number<br />

of moves. For example, make the following five squares into four squares by moving<br />

only three sticks:<br />

The “no underst<strong>and</strong>ing” groups simply learned the solutions to a few such problems.<br />

The “underst<strong>and</strong>ing” groups were given a lesson in the relationship between<br />

number of matches, number of squares, <strong>and</strong> the number of matches that served as<br />

the border between two squares. The most efficient way to decrease the number of<br />

squares is to eliminate squares that share sides with other squares, so that the resulting<br />

squares touch only at their corners. For example, the square in the lower right<br />

is a good one to remove. You can then build a new square on top of the second<br />

by using the bottom of the second square for the top side of the new one. Groups<br />

that learned with underst<strong>and</strong>ing of the common-side principle were able to transfer<br />

better to new problems, <strong>and</strong> they even “remembered” the solutions to example problems<br />

more accurately after a delay, even though these examples were not part of the<br />

lesson itself. The difference between Katona’s demonstrations <strong>and</strong> Wertheimer’s is<br />

4 Scheffler (1965) makes related arguments.

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

Saved successfully!

Ooh no, something went wrong!