Advice on the Writing Projects for Chapter 3

  1. Start with the historical footnote in the text. The standard history of mathematics references, such as [Bo4] and [Ev3], might have something or might provide a hint of where to look next.

  2. One of the major critics of computer-based proofs is the philosopher Thomas Tymoczko. You should look at relevant articles of his and of others (such as [La2], [Ty1], [Ty2], [Sw], and especially [Ty3].) Most of the recent interest was inspired by the computer-aided proof of the Four Color Theorem in 1976; see also Writing Project 14 in Chapter 7. Another computer-assisted proof involved projective planes of order 10.

  3. A textbook on logic programming and/or the language PROLOG, such as [Ap], [Ho2], or [Sa], would be a logical place to start. Many bookstores have huge computer science sections these days, so that source should not be ignored.

  4. There are books on this subject, such as [Du]. A group at the University of Texas has a Web site on the subject.

  5. Even if you can't find a set, you may find some articles about it in materials for high school students and teachers, such as old issues of Mathematics Teacher, published by the National Council of Teachers of Mathematics. This journal, and possibly even copies of the game, may exist in the education library at your school (if there is one).

  6. The classic work in this field is [Go1]. A related and more general topic -- tilings -- is discussed in [GrSh]. There is a Web site dealing with polyominoes that might lead somewhere, as well. Check out the cute applet demonstration on the Web, too.

  7. You can find some references, as well as an historical discussion of the Ackermann function and an iterative algorithm for computing it, in [GrZe]. A Web search for "Ackermann's function" will turn up some good links. (Make sure to spell it correctly!)

  8. See the suggestions for Writing Project 2 in Chapter 1.

  9. Try searching your library's on-line catalog or the Web under keywords like "program correctness" or "verification." Or look at [Ba1], [Di], or [Ho1].

  10. As in Writing Project 9, a key-word search (e.g., for the phrase "operating system security") might turn up something. Two books to look at are [De1] and [GaSp].

Return to main Writing Project page.
Last modified: December 28, 1998.