From: rhinoceros (rhinoceros@freemail.gr)
Date: Fri Feb 27 2004 - 04:59:40 MST
[rhinoceros1]
<snip>
I knew it as "Towers of Hanoi". Nice problem. It is often found in
computer programming textbooks, in the chapter about regression, because
it is a rare clear case where regressive thought is the intuitive way to
go. You know... things like "if I have solved it for n disks, how do I
solve it for n+1 disks". Old plain sequential thought is at a
disadvantage here.
<end snip>
[rhinoceros2]
Scratch out "regression" and "regressive", make it "recursion" and
"recursive". Pardon my Chinese.
____________________________________________________________________
http://www.freemail.gr - δωρεάν υπηρεσία ηλεκτρονικού ταχυδρομείου.
http://www.freemail.gr - free email service for the Greek-speaking.
--- To unsubscribe from the Virus list go to <http://www.lucifer.com/cgi-bin/virus-l>
This archive was generated by hypermail 2.1.5 : Fri Feb 27 2004 - 05:44:08 MST