Moore method

The Moore method is a deductive manner of instruction used in advanced mathematics courses. It is named after Robert Lee Moore, a famous topologist who first used a stronger version of the method at the University of Pennsylvania when he began teaching there in 1911.

The way the course is conducted varies from instructor to instructor, but the content of the course is usually presented in whole or in part by the students themselves. Instead of using a textbook, the students are given a list of definitions and theorems which they are to prove and present in class, leading them through the subject material. The Moore method typically limits the amount of material that a class is able to cover, but its advocates claim that it induces a depth of understanding that listening to lectures cannot give.

The original method

F. Burton Jones, a student of Moore and a practitioner of his method, described it as follows:

Moore would begin his graduate course in topology by carefully selecting the members of the class. If a student had already studied topology elsewhere or had read too much, he would exclude him (in some cases, he would run a separate class for such students). The idea was to have a class as homogeneously ignorant (topologically) as possible. He would usually caution the group not to read topology but simply to use their own ability. Plainly he wanted the competition to be as fair as possible, for competition was one of the driving forces. […]

Having selected the class he would tell them briefly his view of the axiomatic method: there were certain undefined terms (e.g., 'point' and 'region') which had meaning restricted (or controlled) by the axioms (e.g., a region is a point set). He would then state the axioms that the class were to start with […]

After stating the axioms and giving motivating examples to illustrate their meaning he would then state some definitions and theorems. He simply read them from his book as the students copied them down. He would then instruct the class to find proofs of their own and also to construct examples to show that the hypotheses of the theorems could not be weakened, omitted, or partially omitted.

When the class returned for the next meeting he would call on some student to prove Theorem 1. After he became familiar with the abilities of the class members, he would call on them in reverse order and in this way give the more unsuccessful students first chance when they did get a proof. He was flexible with this procedure but it was clear that this was the way he preferred it.

When a student stated that he could prove Theorem x, he was asked to go to the blackboard and present his proof. Then the other students, especially those who had not been able to discover a proof, would make sure that the proof presented was correct and convincing. Moore sternly prevented heckling. This was seldom necessary because the whole atmosphere was one of a serious community effort to understand the argument.

When a flaw appeared in a 'proof' everyone would patiently wait for the student at the board to 'patch it up.' If he could not, he would sit down. Moore would then ask the next student to try or if he thought the difficulty encountered was sufficiently interesting, he would save that theorem until next time and go on to the next unproved theorem (starting again at the bottom of the class).

(Jones 1977)

The students were forbidden to read any book or article about the subject. They were even forbidden to talk about it outside of class. Hersh and John-Steiner claim that, "this method is reminiscent of a well-known, old method of teaching swimming called 'sink or swim' ".

Current usage

After Moore became an associate-professor at University of Texas at Austin in 1920, the Moore method began to gain popularity. Today, the University of Texas at Austin remains a strong advocate of the method and uses it in various courses within their mathematics department, including:

In addition:



External links

This article is issued from Wikipedia - version of the 12/3/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.