Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!willett!ForthNet
From: ForthNet@willett.UUCP (ForthNet articles from GEnie)
Newsgroups: comp.lang.forth
Subject: PUZZLES AND PROBLEMS
Message-ID: <1364.UUL1.3#5129@willett.UUCP>
Date: 19 Jul 90 02:32:09 GMT
Organization: String, Scotch tape, and Paperclips.  (in Pgh, PA)
Lines: 28


 Date: 07-16-90 (22:07)              Number: 3520 (Echo)
   To: W.BADEN1 [WIL]                Refer#: 3504
 From: ROGER BICKNELL                  Read: NO
 Subj: PUZZLES AND PROBLEMS          Status: PUBLIC MESSAGE

 Hmmmmmm. Unfortunately I don't remember the actual puzzle either - 
 except that determining whether an integer was a power of 2 was relevent
 and that there was a second, related problem posed. It was this second 
 problem that I thought was associated with log2.

 I mentioned this to a programmer friend of mine, who subsequently 
 decided to "prove" ( ala exhaustion...) that a Loop would be necessary 
 to determine the log2 of an integer. I replied that I didn't remember 
 there being a Loop in any of the results of the puzzles that were up 
 here a number of months ago. ( I remember some preliminary suggested 
 solutions that used Loops but were succeeded by results that derived the
 answer strictly from logical manipulations). No No No, he said - you 
 definitely require a Loop! I said - Na - 

 I appreciate your answer, Wil, but gosh... you used a Loop !!!

                                                =8-\

 NET/Mail : British Columbia Forth Board - Burnaby BC - (604)434-5886   
-----
This message came from GEnie via willett through a semi-automated process.
Report problems to: uunet!willett!dwp or willett!dwp@hobbes.cert.sei.cmu.edu